/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/safe001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:21:28,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:21:28,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:21:28,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:21:28,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:21:28,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:21:28,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:21:28,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:21:28,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:21:28,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:21:28,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:21:28,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:21:28,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:21:28,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:21:28,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:21:28,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:21:28,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:21:28,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:21:28,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:21:28,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:21:28,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:21:28,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:21:28,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:21:28,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:21:28,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:21:28,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:21:28,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:21:28,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:21:28,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:21:28,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:21:28,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:21:28,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:21:28,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:21:28,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:21:28,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:21:28,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:21:28,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:21:28,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:21:28,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:21:28,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:21:28,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:21:28,240 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 03:21:28,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:21:28,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:21:28,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:21:28,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:21:28,260 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:21:28,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:21:28,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:21:28,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:21:28,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:21:28,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:21:28,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:21:28,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:21:28,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:21:28,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:21:28,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:21:28,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:21:28,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:21:28,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:21:28,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:21:28,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:21:28,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:21:28,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:21:28,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:21:28,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:21:28,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:21:28,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:21:28,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:21:28,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:21:28,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:21:28,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:21:28,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:21:28,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:21:28,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:21:28,574 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:21:28,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2019-12-27 03:21:28,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33a7b4f4/cb2a163bec254884a1161087b1246b55/FLAG5c7d723d2 [2019-12-27 03:21:29,219 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:21:29,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.opt.i [2019-12-27 03:21:29,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33a7b4f4/cb2a163bec254884a1161087b1246b55/FLAG5c7d723d2 [2019-12-27 03:21:29,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33a7b4f4/cb2a163bec254884a1161087b1246b55 [2019-12-27 03:21:29,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:21:29,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:21:29,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:21:29,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:21:29,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:21:29,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:21:29" (1/1) ... [2019-12-27 03:21:29,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2a7ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:29, skipping insertion in model container [2019-12-27 03:21:29,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:21:29" (1/1) ... [2019-12-27 03:21:29,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:21:29,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:21:30,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:21:30,187 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:21:30,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:21:30,333 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:21:30,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30 WrapperNode [2019-12-27 03:21:30,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:21:30,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:21:30,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:21:30,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:21:30,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:21:30,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:21:30,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:21:30,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:21:30,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (1/1) ... [2019-12-27 03:21:30,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:21:30,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:21:30,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:21:30,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:21:30,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (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 03:21:30,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:21:30,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:21:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:21:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:21:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:21:30,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:21:30,533 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:21:30,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:21:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:21:30,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:21:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:21:30,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:21:30,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:21:30,536 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 03:21:31,319 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:21:31,320 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:21:31,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:21:31 BoogieIcfgContainer [2019-12-27 03:21:31,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:21:31,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:21:31,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:21:31,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:21:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:21:29" (1/3) ... [2019-12-27 03:21:31,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bbdcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:21:31, skipping insertion in model container [2019-12-27 03:21:31,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:21:30" (2/3) ... [2019-12-27 03:21:31,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bbdcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:21:31, skipping insertion in model container [2019-12-27 03:21:31,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:21:31" (3/3) ... [2019-12-27 03:21:31,338 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_pso.opt.i [2019-12-27 03:21:31,350 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:21:31,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:21:31,363 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:21:31,364 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:21:31,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,425 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,434 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,434 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,468 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,472 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,473 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:21:31,489 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:21:31,509 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:21:31,509 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:21:31,510 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:21:31,510 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:21:31,510 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:21:31,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:21:31,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:21:31,510 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:21:31,527 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 03:21:31,529 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:21:31,633 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:21:31,633 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:21:31,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:21:31,672 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:21:31,729 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:21:31,730 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:21:31,738 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:21:31,758 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 03:21:31,760 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:21:36,893 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:21:37,001 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:21:37,030 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-27 03:21:37,030 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 03:21:37,034 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-27 03:21:53,474 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-27 03:21:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-27 03:21:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:21:53,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:21:53,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:21:53,483 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 03:21:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:21:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-27 03:21:53,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:21:53,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120324402] [2019-12-27 03:21:53,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:21:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:21:53,727 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 03:21:53,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120324402] [2019-12-27 03:21:53,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:21:53,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:21:53,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611662730] [2019-12-27 03:21:53,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:21:53,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:21:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:21:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:21:53,748 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-27 03:21:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:21:54,775 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-27 03:21:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:21:54,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:21:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:21:58,241 INFO L225 Difference]: With dead ends: 107108 [2019-12-27 03:21:58,241 INFO L226 Difference]: Without dead ends: 104924 [2019-12-27 03:21:58,242 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 03:22:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-27 03:22:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-27 03:22:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-27 03:22:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-27 03:22:08,834 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-27 03:22:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:08,834 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-27 03:22:08,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-27 03:22:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:22:08,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:08,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:22:08,841 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 03:22:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-27 03:22:08,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:08,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2717956] [2019-12-27 03:22:08,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:08,961 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 03:22:08,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2717956] [2019-12-27 03:22:08,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:08,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:22:08,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992375575] [2019-12-27 03:22:08,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:22:08,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:22:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:22:08,965 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-27 03:22:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:14,424 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-27 03:22:14,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:22:14,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:22:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:15,201 INFO L225 Difference]: With dead ends: 168606 [2019-12-27 03:22:15,202 INFO L226 Difference]: Without dead ends: 168557 [2019-12-27 03:22:15,203 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 03:22:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-27 03:22:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-27 03:22:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-27 03:22:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-27 03:22:23,249 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-27 03:22:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:23,250 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-27 03:22:23,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:22:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-27 03:22:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:22:23,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:23,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:22:23,257 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 03:22:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:23,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-27 03:22:23,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:23,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690866175] [2019-12-27 03:22:23,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:22:23,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690866175] [2019-12-27 03:22:23,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:23,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:22:23,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622392553] [2019-12-27 03:22:23,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:22:23,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:22:23,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:22:23,425 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-27 03:22:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:29,790 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-27 03:22:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:22:29,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:22:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:30,363 INFO L225 Difference]: With dead ends: 217678 [2019-12-27 03:22:30,363 INFO L226 Difference]: Without dead ends: 217615 [2019-12-27 03:22:30,364 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 03:22:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-27 03:22:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-27 03:22:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-27 03:22:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-27 03:22:41,990 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-27 03:22:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:41,991 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-27 03:22:41,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:22:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-27 03:22:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:22:41,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:41,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:22:41,995 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 03:22:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-27 03:22:41,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:41,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790100810] [2019-12-27 03:22:41,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:42,053 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 03:22:42,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790100810] [2019-12-27 03:22:42,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:42,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:22:42,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222567509] [2019-12-27 03:22:42,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:22:42,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:22:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:42,055 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-27 03:22:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:42,181 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-27 03:22:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:22:42,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:22:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:42,236 INFO L225 Difference]: With dead ends: 36985 [2019-12-27 03:22:42,237 INFO L226 Difference]: Without dead ends: 36985 [2019-12-27 03:22:42,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-27 03:22:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-27 03:22:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-27 03:22:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-27 03:22:48,534 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-27 03:22:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:48,534 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-27 03:22:48,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-27 03:22:48,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:22:48,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:48,538 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 03:22:48,538 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 03:22:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-27 03:22:48,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:48,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574242925] [2019-12-27 03:22:48,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:22:48,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574242925] [2019-12-27 03:22:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:22:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188821218] [2019-12-27 03:22:48,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:22:48,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:22:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:22:48,666 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-27 03:22:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:49,478 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-27 03:22:49,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:22:49,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:22:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:49,560 INFO L225 Difference]: With dead ends: 50257 [2019-12-27 03:22:49,560 INFO L226 Difference]: Without dead ends: 50244 [2019-12-27 03:22:49,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 03:22:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-27 03:22:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-27 03:22:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-27 03:22:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-27 03:22:50,276 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-27 03:22:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:50,277 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-27 03:22:50,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:22:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-27 03:22:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:22:50,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:50,288 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 03:22:50,288 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 03:22:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-27 03:22:50,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:50,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144569798] [2019-12-27 03:22:50,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:50,344 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 03:22:50,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144569798] [2019-12-27 03:22:50,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:50,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:22:50,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967329132] [2019-12-27 03:22:50,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:22:50,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:22:50,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:22:50,347 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-27 03:22:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:50,386 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-27 03:22:50,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:22:50,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:22:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:50,398 INFO L225 Difference]: With dead ends: 7104 [2019-12-27 03:22:50,398 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 03:22:50,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:22:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 03:22:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-27 03:22:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-27 03:22:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-27 03:22:50,752 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-27 03:22:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:50,752 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-27 03:22:50,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:22:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-27 03:22:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:22:50,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:50,763 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 03:22:50,764 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 03:22:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-27 03:22:50,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:50,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183681941] [2019-12-27 03:22:50,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:50,861 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 03:22:50,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183681941] [2019-12-27 03:22:50,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:50,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:22:50,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939811464] [2019-12-27 03:22:50,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:22:50,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:22:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:22:50,864 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-27 03:22:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:50,905 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-27 03:22:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:22:50,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:22:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:50,913 INFO L225 Difference]: With dead ends: 5024 [2019-12-27 03:22:50,913 INFO L226 Difference]: Without dead ends: 5024 [2019-12-27 03:22:50,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:22:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-27 03:22:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-27 03:22:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-27 03:22:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-27 03:22:50,990 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-27 03:22:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:50,991 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-27 03:22:50,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:22:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-27 03:22:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:22:51,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:51,000 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 03:22:51,000 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 03:22:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-27 03:22:51,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:51,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436974956] [2019-12-27 03:22:51,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:51,093 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 03:22:51,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436974956] [2019-12-27 03:22:51,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:51,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:22:51,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117266927] [2019-12-27 03:22:51,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:22:51,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:22:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:51,095 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-27 03:22:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:51,155 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-27 03:22:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:22:51,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:22:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:51,166 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 03:22:51,167 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 03:22:51,168 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 03:22:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 03:22:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 03:22:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:22:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-27 03:22:51,271 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-27 03:22:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:51,273 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-27 03:22:51,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-27 03:22:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:22:51,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:51,284 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 03:22:51,284 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 03:22:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-27 03:22:51,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:51,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251149581] [2019-12-27 03:22:51,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:51,390 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 03:22:51,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251149581] [2019-12-27 03:22:51,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:51,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:22:51,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268401033] [2019-12-27 03:22:51,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:22:51,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:22:51,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:51,393 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-27 03:22:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:51,442 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-27 03:22:51,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:22:51,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:22:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:51,450 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 03:22:51,450 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 03:22:51,450 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 03:22:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 03:22:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 03:22:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:22:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-27 03:22:51,537 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-27 03:22:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:51,537 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-27 03:22:51,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-27 03:22:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:22:51,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:51,547 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 03:22:51,548 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 03:22:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-27 03:22:51,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:51,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647626019] [2019-12-27 03:22:51,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:51,684 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 03:22:51,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647626019] [2019-12-27 03:22:51,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:51,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:22:51,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861814601] [2019-12-27 03:22:51,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:22:51,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:51,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:22:51,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:51,688 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 3 states. [2019-12-27 03:22:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:51,716 INFO L93 Difference]: Finished difference Result 4665 states and 13233 transitions. [2019-12-27 03:22:51,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:22:51,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:22:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:51,724 INFO L225 Difference]: With dead ends: 4665 [2019-12-27 03:22:51,724 INFO L226 Difference]: Without dead ends: 4665 [2019-12-27 03:22:51,724 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 03:22:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2019-12-27 03:22:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 4665. [2019-12-27 03:22:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 03:22:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13233 transitions. [2019-12-27 03:22:51,817 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13233 transitions. Word has length 65 [2019-12-27 03:22:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:51,818 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13233 transitions. [2019-12-27 03:22:51,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13233 transitions. [2019-12-27 03:22:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:51,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:51,829 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 03:22:51,829 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 03:22:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1887448171, now seen corresponding path program 1 times [2019-12-27 03:22:51,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:51,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182439069] [2019-12-27 03:22:51,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:51,961 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 03:22:51,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182439069] [2019-12-27 03:22:51,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:51,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:22:51,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343160932] [2019-12-27 03:22:51,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:22:51,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:51,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:22:51,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:22:51,965 INFO L87 Difference]: Start difference. First operand 4665 states and 13233 transitions. Second operand 5 states. [2019-12-27 03:22:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:52,339 INFO L93 Difference]: Finished difference Result 6995 states and 19609 transitions. [2019-12-27 03:22:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:22:52,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 03:22:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:52,351 INFO L225 Difference]: With dead ends: 6995 [2019-12-27 03:22:52,351 INFO L226 Difference]: Without dead ends: 6995 [2019-12-27 03:22:52,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:22:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-12-27 03:22:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 4949. [2019-12-27 03:22:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 03:22:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-27 03:22:52,502 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 66 [2019-12-27 03:22:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:52,504 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-27 03:22:52,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:22:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-27 03:22:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:52,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:52,514 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 03:22:52,515 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 03:22:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash 284491425, now seen corresponding path program 2 times [2019-12-27 03:22:52,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:52,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850699856] [2019-12-27 03:22:52,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:52,676 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 03:22:52,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850699856] [2019-12-27 03:22:52,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:52,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:22:52,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170132081] [2019-12-27 03:22:52,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:22:52,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:22:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:22:52,679 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 6 states. [2019-12-27 03:22:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:53,103 INFO L93 Difference]: Finished difference Result 6941 states and 19455 transitions. [2019-12-27 03:22:53,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:22:53,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 03:22:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:53,113 INFO L225 Difference]: With dead ends: 6941 [2019-12-27 03:22:53,113 INFO L226 Difference]: Without dead ends: 6941 [2019-12-27 03:22:53,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:22:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2019-12-27 03:22:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 5572. [2019-12-27 03:22:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-12-27 03:22:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 15823 transitions. [2019-12-27 03:22:53,204 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 15823 transitions. Word has length 66 [2019-12-27 03:22:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:53,204 INFO L462 AbstractCegarLoop]: Abstraction has 5572 states and 15823 transitions. [2019-12-27 03:22:53,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:22:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 15823 transitions. [2019-12-27 03:22:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:53,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:53,212 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 03:22:53,212 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 03:22:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2082058241, now seen corresponding path program 3 times [2019-12-27 03:22:53,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:53,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023287592] [2019-12-27 03:22:53,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:53,313 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 03:22:53,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023287592] [2019-12-27 03:22:53,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:53,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:22:53,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185494906] [2019-12-27 03:22:53,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:22:53,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:53,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:22:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:22:53,316 INFO L87 Difference]: Start difference. First operand 5572 states and 15823 transitions. Second operand 6 states. [2019-12-27 03:22:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:53,761 INFO L93 Difference]: Finished difference Result 7758 states and 21651 transitions. [2019-12-27 03:22:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:22:53,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 03:22:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:53,772 INFO L225 Difference]: With dead ends: 7758 [2019-12-27 03:22:53,772 INFO L226 Difference]: Without dead ends: 7758 [2019-12-27 03:22:53,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:22:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2019-12-27 03:22:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 6183. [2019-12-27 03:22:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2019-12-27 03:22:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 17414 transitions. [2019-12-27 03:22:53,942 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 17414 transitions. Word has length 66 [2019-12-27 03:22:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:53,943 INFO L462 AbstractCegarLoop]: Abstraction has 6183 states and 17414 transitions. [2019-12-27 03:22:53,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:22:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 17414 transitions. [2019-12-27 03:22:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:53,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:53,955 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 03:22:53,956 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 03:22:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:53,956 INFO L82 PathProgramCache]: Analyzing trace with hash 504707035, now seen corresponding path program 4 times [2019-12-27 03:22:53,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:53,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063380444] [2019-12-27 03:22:53,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:54,205 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 03:22:54,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063380444] [2019-12-27 03:22:54,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:54,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:22:54,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930774000] [2019-12-27 03:22:54,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:22:54,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:54,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:22:54,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:22:54,207 INFO L87 Difference]: Start difference. First operand 6183 states and 17414 transitions. Second operand 7 states. [2019-12-27 03:22:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:54,346 INFO L93 Difference]: Finished difference Result 13361 states and 37831 transitions. [2019-12-27 03:22:54,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:22:54,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 03:22:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:54,358 INFO L225 Difference]: With dead ends: 13361 [2019-12-27 03:22:54,359 INFO L226 Difference]: Without dead ends: 7548 [2019-12-27 03:22:54,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:22:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-12-27 03:22:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 5739. [2019-12-27 03:22:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5739 states. [2019-12-27 03:22:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 16175 transitions. [2019-12-27 03:22:54,445 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 16175 transitions. Word has length 66 [2019-12-27 03:22:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:54,446 INFO L462 AbstractCegarLoop]: Abstraction has 5739 states and 16175 transitions. [2019-12-27 03:22:54,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:22:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 16175 transitions. [2019-12-27 03:22:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:54,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:54,453 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 03:22:54,453 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 03:22:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1371430531, now seen corresponding path program 5 times [2019-12-27 03:22:54,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:54,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369372231] [2019-12-27 03:22:54,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:54,573 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 03:22:54,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369372231] [2019-12-27 03:22:54,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:54,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:22:54,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786852657] [2019-12-27 03:22:54,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:22:54,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:22:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:22:54,575 INFO L87 Difference]: Start difference. First operand 5739 states and 16175 transitions. Second operand 6 states. [2019-12-27 03:22:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:54,694 INFO L93 Difference]: Finished difference Result 9586 states and 27052 transitions. [2019-12-27 03:22:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:22:54,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 03:22:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:54,701 INFO L225 Difference]: With dead ends: 9586 [2019-12-27 03:22:54,701 INFO L226 Difference]: Without dead ends: 4332 [2019-12-27 03:22:54,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:22:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2019-12-27 03:22:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 3774. [2019-12-27 03:22:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2019-12-27 03:22:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 10613 transitions. [2019-12-27 03:22:54,785 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 10613 transitions. Word has length 66 [2019-12-27 03:22:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:54,785 INFO L462 AbstractCegarLoop]: Abstraction has 3774 states and 10613 transitions. [2019-12-27 03:22:54,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:22:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 10613 transitions. [2019-12-27 03:22:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:54,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:54,793 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 03:22:54,794 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 03:22:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1243763205, now seen corresponding path program 6 times [2019-12-27 03:22:54,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:54,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963261216] [2019-12-27 03:22:54,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:55,026 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 03:22:55,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963261216] [2019-12-27 03:22:55,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:55,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:22:55,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492449490] [2019-12-27 03:22:55,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:22:55,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:22:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:22:55,032 INFO L87 Difference]: Start difference. First operand 3774 states and 10613 transitions. Second operand 10 states. [2019-12-27 03:22:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:55,868 INFO L93 Difference]: Finished difference Result 7035 states and 19156 transitions. [2019-12-27 03:22:55,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:22:55,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 03:22:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:55,878 INFO L225 Difference]: With dead ends: 7035 [2019-12-27 03:22:55,878 INFO L226 Difference]: Without dead ends: 7035 [2019-12-27 03:22:55,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:22:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7035 states. [2019-12-27 03:22:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7035 to 3543. [2019-12-27 03:22:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3543 states. [2019-12-27 03:22:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 9841 transitions. [2019-12-27 03:22:55,947 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 9841 transitions. Word has length 66 [2019-12-27 03:22:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:55,947 INFO L462 AbstractCegarLoop]: Abstraction has 3543 states and 9841 transitions. [2019-12-27 03:22:55,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:22:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 9841 transitions. [2019-12-27 03:22:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:22:55,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:55,952 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 03:22:55,952 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:22:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1958263493, now seen corresponding path program 7 times [2019-12-27 03:22:55,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:55,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690844507] [2019-12-27 03:22:55,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:56,020 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 03:22:56,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690844507] [2019-12-27 03:22:56,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:22:56,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886467345] [2019-12-27 03:22:56,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:22:56,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:22:56,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:56,023 INFO L87 Difference]: Start difference. First operand 3543 states and 9841 transitions. Second operand 3 states. [2019-12-27 03:22:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:56,070 INFO L93 Difference]: Finished difference Result 3543 states and 9840 transitions. [2019-12-27 03:22:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:22:56,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:22:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:56,075 INFO L225 Difference]: With dead ends: 3543 [2019-12-27 03:22:56,075 INFO L226 Difference]: Without dead ends: 3543 [2019-12-27 03:22:56,076 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 03:22:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-12-27 03:22:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 2581. [2019-12-27 03:22:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2581 states. [2019-12-27 03:22:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 7228 transitions. [2019-12-27 03:22:56,139 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 7228 transitions. Word has length 66 [2019-12-27 03:22:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:56,140 INFO L462 AbstractCegarLoop]: Abstraction has 2581 states and 7228 transitions. [2019-12-27 03:22:56,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 7228 transitions. [2019-12-27 03:22:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:22:56,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:56,146 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 03:22:56,146 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:22:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:56,147 INFO L82 PathProgramCache]: Analyzing trace with hash -247337982, now seen corresponding path program 1 times [2019-12-27 03:22:56,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:56,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218609449] [2019-12-27 03:22:56,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:22:56,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218609449] [2019-12-27 03:22:56,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:56,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:22:56,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934259899] [2019-12-27 03:22:56,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:22:56,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:22:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:22:56,283 INFO L87 Difference]: Start difference. First operand 2581 states and 7228 transitions. Second operand 8 states. [2019-12-27 03:22:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:56,769 INFO L93 Difference]: Finished difference Result 4129 states and 11434 transitions. [2019-12-27 03:22:56,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:22:56,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 03:22:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:56,776 INFO L225 Difference]: With dead ends: 4129 [2019-12-27 03:22:56,776 INFO L226 Difference]: Without dead ends: 4129 [2019-12-27 03:22:56,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:22:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-27 03:22:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 2618. [2019-12-27 03:22:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2618 states. [2019-12-27 03:22:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7335 transitions. [2019-12-27 03:22:56,838 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7335 transitions. Word has length 67 [2019-12-27 03:22:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:56,838 INFO L462 AbstractCegarLoop]: Abstraction has 2618 states and 7335 transitions. [2019-12-27 03:22:56,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:22:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7335 transitions. [2019-12-27 03:22:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:22:56,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:56,841 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 03:22:56,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:22:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2047410026, now seen corresponding path program 2 times [2019-12-27 03:22:56,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:56,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725965415] [2019-12-27 03:22:56,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:22:56,898 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 03:22:56,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725965415] [2019-12-27 03:22:56,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:22:56,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:22:56,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294650571] [2019-12-27 03:22:56,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:22:56,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:22:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:22:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:22:56,900 INFO L87 Difference]: Start difference. First operand 2618 states and 7335 transitions. Second operand 3 states. [2019-12-27 03:22:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:22:56,918 INFO L93 Difference]: Finished difference Result 2320 states and 6398 transitions. [2019-12-27 03:22:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:22:56,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:22:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:22:56,922 INFO L225 Difference]: With dead ends: 2320 [2019-12-27 03:22:56,922 INFO L226 Difference]: Without dead ends: 2320 [2019-12-27 03:22:56,922 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 03:22:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2019-12-27 03:22:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2152. [2019-12-27 03:22:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 03:22:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 5946 transitions. [2019-12-27 03:22:56,967 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 5946 transitions. Word has length 67 [2019-12-27 03:22:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:22:56,967 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 5946 transitions. [2019-12-27 03:22:56,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:22:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 5946 transitions. [2019-12-27 03:22:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:22:56,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:22:56,971 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 03:22:56,971 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:22:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:22:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 1 times [2019-12-27 03:22:56,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:22:56,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478410268] [2019-12-27 03:22:56,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:22:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:22:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:22:57,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:22:57,167 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:22:57,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1810~0.base_20| 1)) (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1810~0.base_20| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1810~0.base_20|) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (= |v_ULTIMATE.start_main_~#t1810~0.offset_17| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1810~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1810~0.base_20|) |v_ULTIMATE.start_main_~#t1810~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff0_thd0~0_372 0) (= v_~y~0_143 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1810~0.base_20|) 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t1810~0.offset=|v_ULTIMATE.start_main_~#t1810~0.offset_17|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_~#t1811~0.base=|v_ULTIMATE.start_main_~#t1811~0.base_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1810~0.base=|v_ULTIMATE.start_main_~#t1810~0.base_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ULTIMATE.start_main_~#t1812~0.base=|v_ULTIMATE.start_main_~#t1812~0.base_20|, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1811~0.offset=|v_ULTIMATE.start_main_~#t1811~0.offset_17|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t1812~0.offset=|v_ULTIMATE.start_main_~#t1812~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, 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_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, 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_#t~ite45, ULTIMATE.start_main_~#t1810~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~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_#t~ite37, ULTIMATE.start_main_~#t1811~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1810~0.base, 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, ULTIMATE.start_main_~#t1812~0.base, ~y~0, ULTIMATE.start_main_~#t1811~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1812~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 03:22:57,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1811~0.base_11| 0)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1811~0.base_11| 1) |v_#valid_31|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1811~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1811~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1811~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1811~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1811~0.base_11|) |v_ULTIMATE.start_main_~#t1811~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1811~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1811~0.base=|v_ULTIMATE.start_main_~#t1811~0.base_11|, ULTIMATE.start_main_~#t1811~0.offset=|v_ULTIMATE.start_main_~#t1811~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1811~0.base, ULTIMATE.start_main_~#t1811~0.offset] because there is no mapped edge [2019-12-27 03:22:57,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1812~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1812~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1812~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1812~0.base_9|) |v_ULTIMATE.start_main_~#t1812~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1812~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1812~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1812~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1812~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1812~0.base=|v_ULTIMATE.start_main_~#t1812~0.base_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1812~0.offset=|v_ULTIMATE.start_main_~#t1812~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1812~0.base, #length, ULTIMATE.start_main_~#t1812~0.offset] because there is no mapped edge [2019-12-27 03:22:57,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 03:22:57,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1878626010 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1878626010 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1878626010| ~x$w_buff1~0_In1878626010) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1878626010| ~x~0_In1878626010) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1878626010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1878626010, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1878626010, ~x~0=~x~0_In1878626010} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1878626010|, ~x$w_buff1~0=~x$w_buff1~0_In1878626010, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1878626010, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1878626010, ~x~0=~x~0_In1878626010} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 03:22:57,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |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_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 03:22:57,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1154911800 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1154911800 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1154911800| ~x$w_buff0_used~0_In-1154911800) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1154911800| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1154911800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1154911800} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1154911800, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1154911800|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1154911800} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:22:57,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1081184254 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1081184254 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1081184254 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1081184254 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1081184254 |P2Thread1of1ForFork2_#t~ite18_Out-1081184254|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1081184254|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081184254, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1081184254, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1081184254, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081184254} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1081184254, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1081184254, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1081184254, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1081184254|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1081184254} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 03:22:57,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1994392599 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1994392599| |P0Thread1of1ForFork0_#t~ite3_Out-1994392599|)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1994392599 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1994392599| ~x~0_In-1994392599) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-1994392599| ~x$w_buff1~0_In-1994392599)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1994392599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1994392599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1994392599, ~x~0=~x~0_In-1994392599} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1994392599|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1994392599|, ~x$w_buff1~0=~x$w_buff1~0_In-1994392599, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1994392599, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1994392599, ~x~0=~x~0_In-1994392599} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 03:22:57,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In509581333 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In509581333 256)))) (or (and (= ~x$w_buff0_used~0_In509581333 |P0Thread1of1ForFork0_#t~ite5_Out509581333|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out509581333|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In509581333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In509581333} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out509581333|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In509581333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In509581333} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:22:57,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1837520057 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1837520057 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1837520057 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1837520057 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1837520057| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1837520057| ~x$w_buff1_used~0_In1837520057) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1837520057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1837520057, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1837520057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1837520057} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1837520057|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1837520057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1837520057, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1837520057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1837520057} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:22:57,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1911273253 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1911273253 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1911273253| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-1911273253 |P2Thread1of1ForFork2_#t~ite19_Out-1911273253|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1911273253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1911273253} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1911273253, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1911273253|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1911273253} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 03:22:57,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In581557938 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In581557938 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In581557938 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In581557938 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In581557938 |P2Thread1of1ForFork2_#t~ite20_Out581557938|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite20_Out581557938| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In581557938, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In581557938, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In581557938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In581557938} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out581557938|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In581557938, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In581557938, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In581557938, ~x$w_buff0_used~0=~x$w_buff0_used~0_In581557938} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 03:22:57,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, 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 03:22:57,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1071979003 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1071979003 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1071979003| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out1071979003| ~x$r_buff0_thd1~0_In1071979003)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1071979003, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071979003} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1071979003, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1071979003|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1071979003} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:22:57,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-310924791 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-310924791 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-310924791 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-310924791 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-310924791|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd1~0_In-310924791 |P0Thread1of1ForFork0_#t~ite8_Out-310924791|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-310924791, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-310924791, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-310924791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-310924791} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-310924791, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-310924791|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-310924791, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-310924791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-310924791} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:22:57,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} 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 03:22:57,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1040605634 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1040605634 256) 0))) (or (and (= ~x$w_buff0_used~0_In1040605634 |P1Thread1of1ForFork1_#t~ite11_Out1040605634|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1040605634| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1040605634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1040605634} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1040605634|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1040605634, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1040605634} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:22:57,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In185112437 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In185112437 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In185112437 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In185112437 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out185112437| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In185112437 |P1Thread1of1ForFork1_#t~ite12_Out185112437|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In185112437, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In185112437, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In185112437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185112437} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In185112437, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In185112437, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out185112437|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In185112437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In185112437} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:22:57,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1978652504 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1978652504 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1978652504 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1978652504 ~x$r_buff0_thd2~0_In-1978652504) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1978652504, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1978652504} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1978652504|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1978652504, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1978652504} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:22:57,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1490548379 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1490548379 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1490548379 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1490548379 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1490548379|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1490548379| ~x$r_buff1_thd2~0_In1490548379) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1490548379, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1490548379, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1490548379, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1490548379} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1490548379, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1490548379, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1490548379, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1490548379|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1490548379} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:22:57,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, 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 03:22:57,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:22:57,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1075123029 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1075123029 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out1075123029| |ULTIMATE.start_main_#t~ite25_Out1075123029|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In1075123029 |ULTIMATE.start_main_#t~ite24_Out1075123029|)) (and (or .cse1 .cse0) .cse2 (= ~x~0_In1075123029 |ULTIMATE.start_main_#t~ite24_Out1075123029|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1075123029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075123029, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1075123029, ~x~0=~x~0_In1075123029} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1075123029, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1075123029|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1075123029|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1075123029, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1075123029, ~x~0=~x~0_In1075123029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 03:22:57,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1610194248 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1610194248 256)))) (or (and (= ~x$w_buff0_used~0_In1610194248 |ULTIMATE.start_main_#t~ite26_Out1610194248|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out1610194248| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1610194248, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1610194248} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1610194248, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1610194248|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1610194248} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 03:22:57,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In39670719 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In39670719 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In39670719 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In39670719 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out39670719| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite27_Out39670719| ~x$w_buff1_used~0_In39670719)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In39670719, ~x$w_buff1_used~0=~x$w_buff1_used~0_In39670719, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In39670719, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39670719} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In39670719, ~x$w_buff1_used~0=~x$w_buff1_used~0_In39670719, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out39670719|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In39670719, ~x$w_buff0_used~0=~x$w_buff0_used~0_In39670719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 03:22:57,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-416095277 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-416095277 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-416095277 |ULTIMATE.start_main_#t~ite28_Out-416095277|)) (and (= |ULTIMATE.start_main_#t~ite28_Out-416095277| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-416095277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-416095277} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-416095277, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-416095277|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-416095277} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 03:22:57,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In442330113 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In442330113 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In442330113 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In442330113 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out442330113| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In442330113 |ULTIMATE.start_main_#t~ite29_Out442330113|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In442330113, ~x$w_buff1_used~0=~x$w_buff1_used~0_In442330113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In442330113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In442330113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In442330113, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out442330113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In442330113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In442330113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In442330113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:22:57,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} 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 03:22:57,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:22:57,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:22:57,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:22:57 BasicIcfg [2019-12-27 03:22:57,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:22:57,412 INFO L168 Benchmark]: Toolchain (without parser) took 87871.58 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 03:22:57,412 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 03:22:57,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.46 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 154.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:22:57,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.72 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:22:57,414 INFO L168 Benchmark]: Boogie Preprocessor took 41.06 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:22:57,415 INFO L168 Benchmark]: RCFGBuilder took 875.76 ms. Allocated memory is still 201.3 MB. Free memory was 149.0 MB in the beginning and 98.8 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:22:57,416 INFO L168 Benchmark]: TraceAbstraction took 86085.60 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 03:22:57,419 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.46 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 154.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.72 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.06 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.76 ms. Allocated memory is still 201.3 MB. Free memory was 149.0 MB in the beginning and 98.8 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86085.60 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1810, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L807] FCALL, FORK 0 pthread_create(&t1811, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L809] FCALL, FORK 0 pthread_create(&t1812, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 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=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 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 [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 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) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 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 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 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 [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 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 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L826] 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_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L826] 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) [L827] 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_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L827] 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)) [L828] 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_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L828] 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)) [L829] 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_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L829] 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)) [L830] 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_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L830] 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)) [L832] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] [L832] 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)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2688 SDtfs, 2240 SDslu, 4829 SDs, 0 SdLazy, 3099 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred 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: 38.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 77154 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 895 ConstructedInterpolants, 0 QuantifiedInterpolants, 153615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...