/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:59:45,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:59:45,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:59:45,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:59:45,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:59:45,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:59:45,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:59:45,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:59:45,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:59:45,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:59:45,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:59:45,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:59:45,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:59:45,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:59:45,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:59:45,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:59:45,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:59:45,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:59:45,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:59:45,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:59:45,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:59:45,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:59:45,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:59:45,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:59:45,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:59:45,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:59:45,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:59:45,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:59:45,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:59:45,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:59:45,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:59:45,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:59:45,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:59:45,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:59:45,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:59:45,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:59:45,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:59:45,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:59:45,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:59:45,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:59:45,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:59:45,306 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-MCR.epf [2019-12-27 17:59:45,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:59:45,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:59:45,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:59:45,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:59:45,323 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:59:45,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:59:45,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:59:45,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:59:45,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:59:45,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:59:45,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:59:45,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:59:45,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:59:45,328 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:59:45,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:59:45,328 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:59:45,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:59:45,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:59:45,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:59:45,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:59:45,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:59:45,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:59:45,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:59:45,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:59:45,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:59:45,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:59:45,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:59:45,332 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:59:45,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:59:45,333 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:59:45,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:59:45,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:59:45,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:59:45,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:59:45,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:59:45,623 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:59:45,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-27 17:59:45,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58824ace/7adce92aabd8458d9b58c6e6608871f9/FLAG957debda5 [2019-12-27 17:59:46,236 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:59:46,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-27 17:59:46,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58824ace/7adce92aabd8458d9b58c6e6608871f9/FLAG957debda5 [2019-12-27 17:59:46,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d58824ace/7adce92aabd8458d9b58c6e6608871f9 [2019-12-27 17:59:46,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:59:46,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:59:46,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:59:46,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:59:46,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:59:46,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:59:46" (1/1) ... [2019-12-27 17:59:46,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba015a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:46, skipping insertion in model container [2019-12-27 17:59:46,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:59:46" (1/1) ... [2019-12-27 17:59:46,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:59:46,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:59:47,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:59:47,179 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:59:47,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:59:47,344 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:59:47,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47 WrapperNode [2019-12-27 17:59:47,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:59:47,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:59:47,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:59:47,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:59:47,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:59:47,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:59:47,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:59:47,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:59:47,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (1/1) ... [2019-12-27 17:59:47,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:59:47,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:59:47,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:59:47,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:59:47,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (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 17:59:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:59:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:59:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:59:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:59:47,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:59:47,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:59:47,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:59:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:59:47,547 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:59:47,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:59:47,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:59:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:59:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:59:47,550 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 17:59:48,314 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:59:48,315 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:59:48,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:59:48 BoogieIcfgContainer [2019-12-27 17:59:48,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:59:48,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:59:48,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:59:48,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:59:48,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:59:46" (1/3) ... [2019-12-27 17:59:48,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c45329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:59:48, skipping insertion in model container [2019-12-27 17:59:48,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:59:47" (2/3) ... [2019-12-27 17:59:48,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c45329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:59:48, skipping insertion in model container [2019-12-27 17:59:48,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:59:48" (3/3) ... [2019-12-27 17:59:48,325 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_rmo.opt.i [2019-12-27 17:59:48,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:59:48,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:59:48,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:59:48,343 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:59:48,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,385 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:59:48,476 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:59:48,497 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:59:48,497 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:59:48,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:59:48,497 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:59:48,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:59:48,497 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:59:48,498 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:59:48,498 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:59:48,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 17:59:48,515 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 17:59:48,628 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 17:59:48,628 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:59:48,644 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:59:48,667 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 17:59:48,718 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 17:59:48,718 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:59:48,725 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:59:48,745 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 17:59:48,746 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:59:54,087 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 17:59:54,207 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 17:59:54,234 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-27 17:59:54,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 17:59:54,238 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 18:00:04,625 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-27 18:00:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-27 18:00:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:00:04,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:04,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:00:04,636 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-27 18:00:04,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:04,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131632266] [2019-12-27 18:00:04,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:04,879 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 18:00:04,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131632266] [2019-12-27 18:00:04,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:04,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:00:04,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280971089] [2019-12-27 18:00:04,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:04,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:04,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:00:04,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:04,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:04,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:04,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:04,927 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-27 18:00:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:05,893 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-27 18:00:05,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:05,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:00:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:08,804 INFO L225 Difference]: With dead ends: 79498 [2019-12-27 18:00:08,805 INFO L226 Difference]: Without dead ends: 74626 [2019-12-27 18:00:08,806 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 18:00:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-27 18:00:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-27 18:00:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-27 18:00:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-27 18:00:14,130 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-27 18:00:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:14,130 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-27 18:00:14,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-27 18:00:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:00:14,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:14,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:14,139 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-27 18:00:14,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:14,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633512196] [2019-12-27 18:00:14,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:14,271 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 18:00:14,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633512196] [2019-12-27 18:00:14,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:14,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:14,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64830163] [2019-12-27 18:00:14,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:14,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:14,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:00:14,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:14,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:14,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:14,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:14,281 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-27 18:00:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:14,637 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-27 18:00:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:14,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:00:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:14,705 INFO L225 Difference]: With dead ends: 19918 [2019-12-27 18:00:14,705 INFO L226 Difference]: Without dead ends: 19918 [2019-12-27 18:00:14,706 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 18:00:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-27 18:00:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-27 18:00:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-27 18:00:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-27 18:00:18,149 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-27 18:00:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:18,149 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-27 18:00:18,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-27 18:00:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:00:18,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:18,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:18,152 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-27 18:00:18,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:18,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939563590] [2019-12-27 18:00:18,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:18,250 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 18:00:18,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939563590] [2019-12-27 18:00:18,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:18,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:18,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492798687] [2019-12-27 18:00:18,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:18,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:18,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:00:18,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:18,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:18,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:18,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:18,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:18,256 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-27 18:00:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:18,609 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-27 18:00:18,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:18,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:00:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:18,693 INFO L225 Difference]: With dead ends: 29603 [2019-12-27 18:00:18,693 INFO L226 Difference]: Without dead ends: 29589 [2019-12-27 18:00:18,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:00:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-27 18:00:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-27 18:00:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-27 18:00:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-27 18:00:19,549 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-27 18:00:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:19,550 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-27 18:00:19,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-27 18:00:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:00:19,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:19,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:00:19,553 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-27 18:00:19,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:19,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007227090] [2019-12-27 18:00:19,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:19,683 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 18:00:19,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007227090] [2019-12-27 18:00:19,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:19,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:19,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584919909] [2019-12-27 18:00:19,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:19,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:19,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:00:19,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:19,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:00:19,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:00:19,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:00:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:00:19,807 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 7 states. [2019-12-27 18:00:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:20,681 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-27 18:00:20,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:00:20,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 18:00:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:20,780 INFO L225 Difference]: With dead ends: 40028 [2019-12-27 18:00:20,780 INFO L226 Difference]: Without dead ends: 40010 [2019-12-27 18:00:20,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:00:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-27 18:00:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-27 18:00:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-27 18:00:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-27 18:00:21,580 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-27 18:00:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:21,581 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-27 18:00:21,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:00:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-27 18:00:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:00:21,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:21,592 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] [2019-12-27 18:00:21,592 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:21,593 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-27 18:00:21,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:21,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125446594] [2019-12-27 18:00:21,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:21,733 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 18:00:21,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125446594] [2019-12-27 18:00:21,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:21,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:00:21,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899772612] [2019-12-27 18:00:21,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:21,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:21,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 18:00:21,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:21,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:00:21,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:00:21,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:00:21,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:21,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:00:21,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:00:21,948 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 9 states. [2019-12-27 18:00:22,547 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-12-27 18:00:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:24,551 INFO L93 Difference]: Finished difference Result 91747 states and 301001 transitions. [2019-12-27 18:00:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:00:24,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 18:00:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:24,761 INFO L225 Difference]: With dead ends: 91747 [2019-12-27 18:00:24,761 INFO L226 Difference]: Without dead ends: 91710 [2019-12-27 18:00:24,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:00:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91710 states. [2019-12-27 18:00:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91710 to 44228. [2019-12-27 18:00:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44228 states. [2019-12-27 18:00:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44228 states to 44228 states and 147919 transitions. [2019-12-27 18:00:26,248 INFO L78 Accepts]: Start accepts. Automaton has 44228 states and 147919 transitions. Word has length 22 [2019-12-27 18:00:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:26,248 INFO L462 AbstractCegarLoop]: Abstraction has 44228 states and 147919 transitions. [2019-12-27 18:00:26,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:00:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 44228 states and 147919 transitions. [2019-12-27 18:00:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:00:26,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:26,261 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] [2019-12-27 18:00:26,262 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1820035389, now seen corresponding path program 2 times [2019-12-27 18:00:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:26,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519822573] [2019-12-27 18:00:26,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:00:26,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519822573] [2019-12-27 18:00:26,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:26,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:00:26,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [49671540] [2019-12-27 18:00:26,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:26,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:26,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 18:00:26,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:26,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:26,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:00:26,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:26,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:00:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:00:26,393 INFO L87 Difference]: Start difference. First operand 44228 states and 147919 transitions. Second operand 6 states. [2019-12-27 18:00:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:27,272 INFO L93 Difference]: Finished difference Result 68472 states and 222810 transitions. [2019-12-27 18:00:27,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:00:27,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:00:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:27,451 INFO L225 Difference]: With dead ends: 68472 [2019-12-27 18:00:27,451 INFO L226 Difference]: Without dead ends: 68442 [2019-12-27 18:00:27,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:00:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68442 states. [2019-12-27 18:00:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68442 to 42219. [2019-12-27 18:00:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42219 states. [2019-12-27 18:00:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42219 states to 42219 states and 141184 transitions. [2019-12-27 18:00:30,319 INFO L78 Accepts]: Start accepts. Automaton has 42219 states and 141184 transitions. Word has length 22 [2019-12-27 18:00:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:30,319 INFO L462 AbstractCegarLoop]: Abstraction has 42219 states and 141184 transitions. [2019-12-27 18:00:30,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:00:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 42219 states and 141184 transitions. [2019-12-27 18:00:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:00:30,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:30,335 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 18:00:30,335 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-27 18:00:30,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:30,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170374420] [2019-12-27 18:00:30,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:30,391 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 18:00:30,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170374420] [2019-12-27 18:00:30,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:30,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:30,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061985815] [2019-12-27 18:00:30,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:30,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:30,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:00:30,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:30,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:30,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:30,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:30,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:30,403 INFO L87 Difference]: Start difference. First operand 42219 states and 141184 transitions. Second operand 4 states. [2019-12-27 18:00:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:30,486 INFO L93 Difference]: Finished difference Result 16856 states and 52701 transitions. [2019-12-27 18:00:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:00:30,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:00:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:30,510 INFO L225 Difference]: With dead ends: 16856 [2019-12-27 18:00:30,510 INFO L226 Difference]: Without dead ends: 16856 [2019-12-27 18:00:30,511 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 18:00:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16856 states. [2019-12-27 18:00:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16856 to 16742. [2019-12-27 18:00:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-27 18:00:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 52364 transitions. [2019-12-27 18:00:30,757 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 52364 transitions. Word has length 25 [2019-12-27 18:00:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:30,758 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 52364 transitions. [2019-12-27 18:00:30,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 52364 transitions. [2019-12-27 18:00:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:00:30,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:30,784 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] [2019-12-27 18:00:30,784 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-27 18:00:30,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:30,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710391955] [2019-12-27 18:00:30,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:30,854 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 18:00:30,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710391955] [2019-12-27 18:00:30,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:30,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:00:30,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903160057] [2019-12-27 18:00:30,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:30,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:31,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 18:00:31,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:31,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:31,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:31,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:31,242 INFO L87 Difference]: Start difference. First operand 16742 states and 52364 transitions. Second operand 3 states. [2019-12-27 18:00:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:31,308 INFO L93 Difference]: Finished difference Result 16741 states and 52362 transitions. [2019-12-27 18:00:31,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:31,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 18:00:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:31,333 INFO L225 Difference]: With dead ends: 16741 [2019-12-27 18:00:31,333 INFO L226 Difference]: Without dead ends: 16741 [2019-12-27 18:00:31,333 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 18:00:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16741 states. [2019-12-27 18:00:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16741 to 16741. [2019-12-27 18:00:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16741 states. [2019-12-27 18:00:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16741 states to 16741 states and 52362 transitions. [2019-12-27 18:00:31,576 INFO L78 Accepts]: Start accepts. Automaton has 16741 states and 52362 transitions. Word has length 39 [2019-12-27 18:00:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:31,576 INFO L462 AbstractCegarLoop]: Abstraction has 16741 states and 52362 transitions. [2019-12-27 18:00:31,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 16741 states and 52362 transitions. [2019-12-27 18:00:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:00:31,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:31,608 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] [2019-12-27 18:00:31,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-27 18:00:31,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:31,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799503720] [2019-12-27 18:00:31,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:31,690 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 18:00:31,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799503720] [2019-12-27 18:00:31,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:31,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:00:31,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315724207] [2019-12-27 18:00:31,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:31,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:31,751 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 162 transitions. [2019-12-27 18:00:31,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:31,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:00:31,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:00:31,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:31,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:00:31,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:00:31,753 INFO L87 Difference]: Start difference. First operand 16741 states and 52362 transitions. Second operand 5 states. [2019-12-27 18:00:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:31,848 INFO L93 Difference]: Finished difference Result 15259 states and 48568 transitions. [2019-12-27 18:00:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:31,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 18:00:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:31,878 INFO L225 Difference]: With dead ends: 15259 [2019-12-27 18:00:31,878 INFO L226 Difference]: Without dead ends: 15259 [2019-12-27 18:00:31,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:00:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2019-12-27 18:00:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 14485. [2019-12-27 18:00:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14485 states. [2019-12-27 18:00:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14485 states to 14485 states and 46365 transitions. [2019-12-27 18:00:32,111 INFO L78 Accepts]: Start accepts. Automaton has 14485 states and 46365 transitions. Word has length 40 [2019-12-27 18:00:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:32,112 INFO L462 AbstractCegarLoop]: Abstraction has 14485 states and 46365 transitions. [2019-12-27 18:00:32,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:00:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14485 states and 46365 transitions. [2019-12-27 18:00:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:32,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:32,135 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] [2019-12-27 18:00:32,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-27 18:00:32,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:32,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978337920] [2019-12-27 18:00:32,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:32,198 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 18:00:32,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978337920] [2019-12-27 18:00:32,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:32,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:32,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686242720] [2019-12-27 18:00:32,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:32,216 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:32,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 464 transitions. [2019-12-27 18:00:32,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:32,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:00:32,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:32,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:32,485 INFO L87 Difference]: Start difference. First operand 14485 states and 46365 transitions. Second operand 4 states. [2019-12-27 18:00:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:33,537 INFO L93 Difference]: Finished difference Result 18807 states and 60047 transitions. [2019-12-27 18:00:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:33,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:00:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:33,566 INFO L225 Difference]: With dead ends: 18807 [2019-12-27 18:00:33,566 INFO L226 Difference]: Without dead ends: 18807 [2019-12-27 18:00:33,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 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 18:00:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2019-12-27 18:00:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 12193. [2019-12-27 18:00:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12193 states. [2019-12-27 18:00:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12193 states to 12193 states and 39155 transitions. [2019-12-27 18:00:33,800 INFO L78 Accepts]: Start accepts. Automaton has 12193 states and 39155 transitions. Word has length 54 [2019-12-27 18:00:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:33,800 INFO L462 AbstractCegarLoop]: Abstraction has 12193 states and 39155 transitions. [2019-12-27 18:00:33,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 12193 states and 39155 transitions. [2019-12-27 18:00:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:33,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:33,815 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] [2019-12-27 18:00:33,816 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-27 18:00:33,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:33,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059071742] [2019-12-27 18:00:33,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:33,887 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 18:00:33,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059071742] [2019-12-27 18:00:33,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:33,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:33,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253580064] [2019-12-27 18:00:33,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:33,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:34,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 328 states and 708 transitions. [2019-12-27 18:00:34,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:34,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:34,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:34,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:34,125 INFO L87 Difference]: Start difference. First operand 12193 states and 39155 transitions. Second operand 4 states. [2019-12-27 18:00:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:34,213 INFO L93 Difference]: Finished difference Result 23305 states and 75058 transitions. [2019-12-27 18:00:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:00:34,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:00:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:34,231 INFO L225 Difference]: With dead ends: 23305 [2019-12-27 18:00:34,231 INFO L226 Difference]: Without dead ends: 11421 [2019-12-27 18:00:34,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 18:00:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11421 states. [2019-12-27 18:00:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11421 to 11421. [2019-12-27 18:00:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11421 states. [2019-12-27 18:00:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11421 states to 11421 states and 36793 transitions. [2019-12-27 18:00:34,409 INFO L78 Accepts]: Start accepts. Automaton has 11421 states and 36793 transitions. Word has length 54 [2019-12-27 18:00:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:34,409 INFO L462 AbstractCegarLoop]: Abstraction has 11421 states and 36793 transitions. [2019-12-27 18:00:34,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 11421 states and 36793 transitions. [2019-12-27 18:00:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:34,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:34,423 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] [2019-12-27 18:00:34,423 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-27 18:00:34,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:34,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044450331] [2019-12-27 18:00:34,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:34,494 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 18:00:34,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044450331] [2019-12-27 18:00:34,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:34,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:00:34,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084821073] [2019-12-27 18:00:34,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:34,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:34,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 622 transitions. [2019-12-27 18:00:34,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:34,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:00:34,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:00:34,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:34,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:00:34,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:00:34,912 INFO L87 Difference]: Start difference. First operand 11421 states and 36793 transitions. Second operand 6 states. [2019-12-27 18:00:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:35,028 INFO L93 Difference]: Finished difference Result 32357 states and 104808 transitions. [2019-12-27 18:00:35,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:35,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 18:00:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:35,040 INFO L225 Difference]: With dead ends: 32357 [2019-12-27 18:00:35,040 INFO L226 Difference]: Without dead ends: 6706 [2019-12-27 18:00:35,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:00:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2019-12-27 18:00:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 6706. [2019-12-27 18:00:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-27 18:00:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 21776 transitions. [2019-12-27 18:00:35,150 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 21776 transitions. Word has length 54 [2019-12-27 18:00:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:35,150 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 21776 transitions. [2019-12-27 18:00:35,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:00:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 21776 transitions. [2019-12-27 18:00:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:35,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:35,158 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] [2019-12-27 18:00:35,158 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-27 18:00:35,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:35,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176513223] [2019-12-27 18:00:35,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:35,244 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 18:00:35,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176513223] [2019-12-27 18:00:35,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:35,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:00:35,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899682723] [2019-12-27 18:00:35,245 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:35,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:35,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 425 transitions. [2019-12-27 18:00:35,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:35,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 18:00:35,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:00:35,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:35,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:00:35,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:00:35,515 INFO L87 Difference]: Start difference. First operand 6706 states and 21776 transitions. Second operand 8 states. [2019-12-27 18:00:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:35,815 INFO L93 Difference]: Finished difference Result 11218 states and 36364 transitions. [2019-12-27 18:00:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:00:35,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 18:00:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:35,831 INFO L225 Difference]: With dead ends: 11218 [2019-12-27 18:00:35,831 INFO L226 Difference]: Without dead ends: 8640 [2019-12-27 18:00:35,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:00:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8640 states. [2019-12-27 18:00:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8640 to 7875. [2019-12-27 18:00:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7875 states. [2019-12-27 18:00:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 25651 transitions. [2019-12-27 18:00:35,979 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 25651 transitions. Word has length 54 [2019-12-27 18:00:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:35,980 INFO L462 AbstractCegarLoop]: Abstraction has 7875 states and 25651 transitions. [2019-12-27 18:00:35,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:00:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 25651 transitions. [2019-12-27 18:00:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:35,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:35,990 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] [2019-12-27 18:00:35,990 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-27 18:00:35,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:35,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619470518] [2019-12-27 18:00:35,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:36,064 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 18:00:36,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619470518] [2019-12-27 18:00:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:36,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:00:36,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711819967] [2019-12-27 18:00:36,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:36,081 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:36,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 464 transitions. [2019-12-27 18:00:36,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:36,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:00:36,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:00:36,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:00:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:00:36,371 INFO L87 Difference]: Start difference. First operand 7875 states and 25651 transitions. Second operand 11 states. [2019-12-27 18:00:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:37,864 INFO L93 Difference]: Finished difference Result 17223 states and 55210 transitions. [2019-12-27 18:00:37,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:00:37,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 18:00:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:37,886 INFO L225 Difference]: With dead ends: 17223 [2019-12-27 18:00:37,886 INFO L226 Difference]: Without dead ends: 12726 [2019-12-27 18:00:37,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:00:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12726 states. [2019-12-27 18:00:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12726 to 9350. [2019-12-27 18:00:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9350 states. [2019-12-27 18:00:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9350 states to 9350 states and 30217 transitions. [2019-12-27 18:00:38,063 INFO L78 Accepts]: Start accepts. Automaton has 9350 states and 30217 transitions. Word has length 54 [2019-12-27 18:00:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:38,063 INFO L462 AbstractCegarLoop]: Abstraction has 9350 states and 30217 transitions. [2019-12-27 18:00:38,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:00:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9350 states and 30217 transitions. [2019-12-27 18:00:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:38,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:38,076 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] [2019-12-27 18:00:38,076 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-27 18:00:38,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:38,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363582204] [2019-12-27 18:00:38,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:38,158 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 18:00:38,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363582204] [2019-12-27 18:00:38,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:38,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:00:38,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778262912] [2019-12-27 18:00:38,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:38,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:38,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 358 transitions. [2019-12-27 18:00:38,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:38,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:00:38,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:00:38,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:00:38,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:00:38,498 INFO L87 Difference]: Start difference. First operand 9350 states and 30217 transitions. Second operand 9 states. [2019-12-27 18:00:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:39,739 INFO L93 Difference]: Finished difference Result 29122 states and 91916 transitions. [2019-12-27 18:00:39,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 18:00:39,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 18:00:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:39,774 INFO L225 Difference]: With dead ends: 29122 [2019-12-27 18:00:39,774 INFO L226 Difference]: Without dead ends: 22614 [2019-12-27 18:00:39,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 18:00:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22614 states. [2019-12-27 18:00:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22614 to 10979. [2019-12-27 18:00:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10979 states. [2019-12-27 18:00:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10979 states to 10979 states and 35385 transitions. [2019-12-27 18:00:40,039 INFO L78 Accepts]: Start accepts. Automaton has 10979 states and 35385 transitions. Word has length 54 [2019-12-27 18:00:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:40,039 INFO L462 AbstractCegarLoop]: Abstraction has 10979 states and 35385 transitions. [2019-12-27 18:00:40,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:00:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 10979 states and 35385 transitions. [2019-12-27 18:00:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:00:40,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:40,052 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] [2019-12-27 18:00:40,052 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-27 18:00:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:40,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371416510] [2019-12-27 18:00:40,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:40,128 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 18:00:40,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371416510] [2019-12-27 18:00:40,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:40,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:40,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1996775841] [2019-12-27 18:00:40,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:40,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:40,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 403 transitions. [2019-12-27 18:00:40,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:40,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:00:40,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:00:40,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:00:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:00:40,453 INFO L87 Difference]: Start difference. First operand 10979 states and 35385 transitions. Second operand 4 states. [2019-12-27 18:00:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:40,755 INFO L93 Difference]: Finished difference Result 14130 states and 43827 transitions. [2019-12-27 18:00:40,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:00:40,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:00:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:40,781 INFO L225 Difference]: With dead ends: 14130 [2019-12-27 18:00:40,781 INFO L226 Difference]: Without dead ends: 14130 [2019-12-27 18:00:40,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:00:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14130 states. [2019-12-27 18:00:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14130 to 9254. [2019-12-27 18:00:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9254 states. [2019-12-27 18:00:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9254 states to 9254 states and 28955 transitions. [2019-12-27 18:00:41,045 INFO L78 Accepts]: Start accepts. Automaton has 9254 states and 28955 transitions. Word has length 54 [2019-12-27 18:00:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:41,045 INFO L462 AbstractCegarLoop]: Abstraction has 9254 states and 28955 transitions. [2019-12-27 18:00:41,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:00:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9254 states and 28955 transitions. [2019-12-27 18:00:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:00:41,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:41,057 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] [2019-12-27 18:00:41,057 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-27 18:00:41,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:41,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903042283] [2019-12-27 18:00:41,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:41,151 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 18:00:41,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903042283] [2019-12-27 18:00:41,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:41,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:00:41,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247646949] [2019-12-27 18:00:41,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:41,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:41,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 414 transitions. [2019-12-27 18:00:41,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:41,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:00:41,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:00:41,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:00:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:00:41,419 INFO L87 Difference]: Start difference. First operand 9254 states and 28955 transitions. Second operand 3 states. [2019-12-27 18:00:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:41,487 INFO L93 Difference]: Finished difference Result 9254 states and 28953 transitions. [2019-12-27 18:00:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:00:41,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:00:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:41,505 INFO L225 Difference]: With dead ends: 9254 [2019-12-27 18:00:41,505 INFO L226 Difference]: Without dead ends: 9254 [2019-12-27 18:00:41,506 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 18:00:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9254 states. [2019-12-27 18:00:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9254 to 8934. [2019-12-27 18:00:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 18:00:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 28084 transitions. [2019-12-27 18:00:41,720 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 28084 transitions. Word has length 55 [2019-12-27 18:00:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:41,720 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 28084 transitions. [2019-12-27 18:00:41,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:00:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 28084 transitions. [2019-12-27 18:00:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:41,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:41,734 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] [2019-12-27 18:00:41,734 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-27 18:00:41,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:41,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936561230] [2019-12-27 18:00:41,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:42,145 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 18:00:42,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936561230] [2019-12-27 18:00:42,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:42,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:00:42,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1580806803] [2019-12-27 18:00:42,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:42,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:42,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 415 transitions. [2019-12-27 18:00:42,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:43,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 18:00:43,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:00:43,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:43,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:00:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:00:43,086 INFO L87 Difference]: Start difference. First operand 8934 states and 28084 transitions. Second operand 19 states. [2019-12-27 18:00:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:47,608 INFO L93 Difference]: Finished difference Result 17994 states and 55509 transitions. [2019-12-27 18:00:47,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 18:00:47,609 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-12-27 18:00:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:47,634 INFO L225 Difference]: With dead ends: 17994 [2019-12-27 18:00:47,635 INFO L226 Difference]: Without dead ends: 17684 [2019-12-27 18:00:47,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=949, Invalid=5371, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 18:00:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17684 states. [2019-12-27 18:00:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17684 to 12202. [2019-12-27 18:00:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12202 states. [2019-12-27 18:00:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12202 states to 12202 states and 38327 transitions. [2019-12-27 18:00:47,871 INFO L78 Accepts]: Start accepts. Automaton has 12202 states and 38327 transitions. Word has length 56 [2019-12-27 18:00:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:47,872 INFO L462 AbstractCegarLoop]: Abstraction has 12202 states and 38327 transitions. [2019-12-27 18:00:47,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:00:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 12202 states and 38327 transitions. [2019-12-27 18:00:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:47,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:47,886 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] [2019-12-27 18:00:47,886 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 208159905, now seen corresponding path program 2 times [2019-12-27 18:00:47,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:47,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061351806] [2019-12-27 18:00:47,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:00:48,206 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 18:00:48,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061351806] [2019-12-27 18:00:48,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:00:48,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:00:48,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619277160] [2019-12-27 18:00:48,207 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:00:48,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:00:48,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 420 transitions. [2019-12-27 18:00:48,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:00:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:00:48,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:00:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:00:48,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:00:48,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 18:00:48,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 18:00:48,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:00:48,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 18:00:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:00:48,963 INFO L87 Difference]: Start difference. First operand 12202 states and 38327 transitions. Second operand 20 states. [2019-12-27 18:00:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:00:52,979 INFO L93 Difference]: Finished difference Result 18953 states and 58086 transitions. [2019-12-27 18:00:52,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:00:52,980 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 18:00:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:00:53,002 INFO L225 Difference]: With dead ends: 18953 [2019-12-27 18:00:53,002 INFO L226 Difference]: Without dead ends: 13921 [2019-12-27 18:00:53,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 18:00:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13921 states. [2019-12-27 18:00:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13921 to 11344. [2019-12-27 18:00:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11344 states. [2019-12-27 18:00:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11344 states to 11344 states and 35018 transitions. [2019-12-27 18:00:53,209 INFO L78 Accepts]: Start accepts. Automaton has 11344 states and 35018 transitions. Word has length 56 [2019-12-27 18:00:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:00:53,209 INFO L462 AbstractCegarLoop]: Abstraction has 11344 states and 35018 transitions. [2019-12-27 18:00:53,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 18:00:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11344 states and 35018 transitions. [2019-12-27 18:00:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:00:53,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:00:53,222 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] [2019-12-27 18:00:53,222 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:00:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:00:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 3 times [2019-12-27 18:00:53,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:00:53,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053373930] [2019-12-27 18:00:53,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:00:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:00:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:00:53,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:00:53,338 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:00:53,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1840~0.base_39| 4)) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39|)) (= v_~main$tmp_guard1~0_61 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39| 1)) (= 0 |v_ULTIMATE.start_main_~#t1840~0.offset_25|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1840~0.base_39|) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39|) |v_ULTIMATE.start_main_~#t1840~0.offset_25| 0))) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1840~0.offset=|v_ULTIMATE.start_main_~#t1840~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1840~0.base=|v_ULTIMATE.start_main_~#t1840~0.base_39|, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_29|, 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_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1841~0.offset, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ULTIMATE.start_main_~#t1841~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1840~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1842~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1840~0.base, ULTIMATE.start_main_~#t1842~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:00:53,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1841~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1841~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1841~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10|) |v_ULTIMATE.start_main_~#t1841~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_10|, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1841~0.base, ULTIMATE.start_main_~#t1841~0.offset, #length] because there is no mapped edge [2019-12-27 18:00:53,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1842~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1842~0.base_10|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1842~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10|) |v_ULTIMATE.start_main_~#t1842~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1842~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1842~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1842~0.offset] because there is no mapped edge [2019-12-27 18:00:53,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:00:53,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In309752417 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In309752417 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out309752417| ~x~0_In309752417)) (and (= ~x$w_buff1~0_In309752417 |P2Thread1of1ForFork1_#t~ite32_Out309752417|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In309752417, ~x$w_buff1_used~0=~x$w_buff1_used~0_In309752417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In309752417, ~x~0=~x~0_In309752417} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out309752417|, ~x$w_buff1~0=~x$w_buff1~0_In309752417, ~x$w_buff1_used~0=~x$w_buff1_used~0_In309752417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In309752417, ~x~0=~x~0_In309752417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:00:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-690538032 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-690538032 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-690538032| ~x$w_buff0_used~0_In-690538032)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-690538032| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-690538032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-690538032} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-690538032, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-690538032|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-690538032} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:00:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:00:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1807378787 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1807378787 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1807378787|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1807378787 |P2Thread1of1ForFork1_#t~ite34_Out1807378787|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1807378787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1807378787} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1807378787|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1807378787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1807378787} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:00:53,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In464651503 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In464651503 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In464651503 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In464651503 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out464651503| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out464651503| ~x$w_buff1_used~0_In464651503) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In464651503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In464651503, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In464651503, ~x$w_buff0_used~0=~x$w_buff0_used~0_In464651503} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In464651503, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In464651503, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In464651503, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out464651503|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In464651503} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:00:53,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-316102328 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-316102328 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-316102328) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-316102328 ~x$r_buff0_thd2~0_Out-316102328)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-316102328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-316102328} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-316102328|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-316102328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-316102328} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:00:53,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In1968935402 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1968935402 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1968935402 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1968935402 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1968935402|)) (and (= ~x$r_buff1_thd2~0_In1968935402 |P1Thread1of1ForFork0_#t~ite31_Out1968935402|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1968935402, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1968935402, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1968935402, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1968935402} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1968935402|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1968935402, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1968935402, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1968935402, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1968935402} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:00:53,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:00:53,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1442024327 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1442024327 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1442024327 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-1442024327 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1442024327| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1442024327| ~x$w_buff1_used~0_In-1442024327) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1442024327, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1442024327, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1442024327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1442024327} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1442024327|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1442024327, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1442024327, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1442024327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1442024327} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:00:53,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1051126137 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1051126137 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1051126137| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out1051126137| ~x$r_buff0_thd3~0_In1051126137) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1051126137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1051126137} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1051126137|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1051126137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1051126137} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:00:53,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1386428330 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out1386428330| |P0Thread1of1ForFork2_#t~ite11_Out1386428330|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1386428330 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1386428330 256)) (and (= (mod ~x$r_buff1_thd1~0_In1386428330 256) 0) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In1386428330 256) 0)))) (= ~x$w_buff1~0_In1386428330 |P0Thread1of1ForFork2_#t~ite11_Out1386428330|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite12_Out1386428330| ~x$w_buff1~0_In1386428330) (= |P0Thread1of1ForFork2_#t~ite11_In1386428330| |P0Thread1of1ForFork2_#t~ite11_Out1386428330|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1386428330, ~x$w_buff1~0=~x$w_buff1~0_In1386428330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386428330, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1386428330, ~weak$$choice2~0=~weak$$choice2~0_In1386428330, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1386428330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386428330} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1386428330, ~x$w_buff1~0=~x$w_buff1~0_In1386428330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1386428330, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1386428330, ~weak$$choice2~0=~weak$$choice2~0_In1386428330, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1386428330|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1386428330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1386428330} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:00:53,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1479256769 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out1479256769| ~x$w_buff0_used~0_In1479256769) (= |P0Thread1of1ForFork2_#t~ite14_In1479256769| |P0Thread1of1ForFork2_#t~ite14_Out1479256769|) (not .cse0)) (and (= ~x$w_buff0_used~0_In1479256769 |P0Thread1of1ForFork2_#t~ite14_Out1479256769|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1479256769 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1479256769 256) 0)) (= (mod ~x$w_buff0_used~0_In1479256769 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In1479256769 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite15_Out1479256769| |P0Thread1of1ForFork2_#t~ite14_Out1479256769|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1479256769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1479256769, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1479256769, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1479256769|, ~weak$$choice2~0=~weak$$choice2~0_In1479256769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1479256769} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1479256769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1479256769, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1479256769|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1479256769, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1479256769|, ~weak$$choice2~0=~weak$$choice2~0_In1479256769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1479256769} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:00:53,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:00:53,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-283483698 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-283483698 256) 0))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-283483698 256))) (= 0 (mod ~x$w_buff0_used~0_In-283483698 256)) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-283483698 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite23_Out-283483698| |P0Thread1of1ForFork2_#t~ite24_Out-283483698|) (= ~x$r_buff1_thd1~0_In-283483698 |P0Thread1of1ForFork2_#t~ite23_Out-283483698|) .cse1) (and (not .cse1) (= ~x$r_buff1_thd1~0_In-283483698 |P0Thread1of1ForFork2_#t~ite24_Out-283483698|) (= |P0Thread1of1ForFork2_#t~ite23_In-283483698| |P0Thread1of1ForFork2_#t~ite23_Out-283483698|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-283483698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283483698, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-283483698, ~weak$$choice2~0=~weak$$choice2~0_In-283483698, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-283483698|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283483698} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-283483698, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-283483698, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-283483698, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-283483698|, ~weak$$choice2~0=~weak$$choice2~0_In-283483698, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-283483698|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-283483698} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:00:53,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:00:53,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-1287647499 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1287647499 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1287647499 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1287647499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1287647499|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1287647499| ~x$r_buff1_thd3~0_In-1287647499) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1287647499, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1287647499, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1287647499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287647499} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1287647499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1287647499, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1287647499, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1287647499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287647499} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:00:53,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:00:53,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:00:53,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1720169155 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1720169155 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1720169155| |ULTIMATE.start_main_#t~ite42_Out-1720169155|))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1720169155| ~x~0_In-1720169155) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1720169155| ~x$w_buff1~0_In-1720169155)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1720169155, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1720169155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1720169155, ~x~0=~x~0_In-1720169155} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1720169155|, ~x$w_buff1~0=~x$w_buff1~0_In-1720169155, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1720169155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1720169155, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1720169155|, ~x~0=~x~0_In-1720169155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:00:53,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1537155013 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1537155013 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1537155013|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1537155013 |ULTIMATE.start_main_#t~ite43_Out-1537155013|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1537155013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537155013} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1537155013, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1537155013|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537155013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:00:53,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-987888730 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-987888730 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-987888730 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-987888730 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-987888730 |ULTIMATE.start_main_#t~ite44_Out-987888730|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-987888730|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-987888730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-987888730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-987888730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-987888730} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-987888730, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-987888730, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-987888730, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-987888730|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-987888730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:00:53,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1962883890 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1962883890 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In1962883890 |ULTIMATE.start_main_#t~ite45_Out1962883890|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out1962883890|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1962883890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962883890} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1962883890, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1962883890|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962883890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:00:53,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-87235709 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-87235709 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-87235709 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-87235709 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-87235709 |ULTIMATE.start_main_#t~ite46_Out-87235709|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-87235709|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-87235709, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-87235709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-87235709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-87235709} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-87235709, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-87235709|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-87235709, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-87235709, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-87235709} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:00:53,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:00:53,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:00:53 BasicIcfg [2019-12-27 18:00:53,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:00:53,459 INFO L168 Benchmark]: Toolchain (without parser) took 66948.09 ms. Allocated memory was 137.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 100.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 798.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,462 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.13 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.04 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,464 INFO L168 Benchmark]: Boogie Preprocessor took 45.50 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,464 INFO L168 Benchmark]: RCFGBuilder took 837.06 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 103.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,465 INFO L168 Benchmark]: TraceAbstraction took 65133.93 ms. Allocated memory was 201.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 736.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:00:53,471 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.13 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.6 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.04 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.50 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.06 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 103.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65133.93 ms. Allocated memory was 201.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 736.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1840, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L818] FCALL, FORK 0 pthread_create(&t1841, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1842, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 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=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 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) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 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) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 64.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3286 SDtfs, 5368 SDslu, 12039 SDs, 0 SdLazy, 9489 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 64 SyntacticMatches, 57 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 121662 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 162839 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...