/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/safe024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:36:28,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:36:28,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:36:28,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:36:28,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:36:28,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:36:28,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:36:28,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:36:28,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:36:28,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:36:28,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:36:28,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:36:28,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:36:28,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:36:28,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:36:28,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:36:28,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:36:28,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:36:28,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:36:28,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:36:28,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:36:28,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:36:28,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:36:28,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:36:28,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:36:28,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:36:28,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:36:28,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:36:28,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:36:28,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:36:28,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:36:28,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:36:28,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:36:28,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:36:28,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:36:28,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:36:28,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:36:28,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:36:28,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:36:28,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:36:28,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:36:28,494 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 18:36:28,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:36:28,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:36:28,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:36:28,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:36:28,530 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:36:28,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:36:28,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:36:28,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:36:28,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:36:28,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:36:28,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:36:28,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:36:28,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:36:28,537 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:36:28,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:36:28,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:36:28,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:36:28,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:36:28,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:36:28,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:36:28,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:36:28,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:36:28,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:36:28,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:36:28,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:36:28,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:36:28,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:36:28,540 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:36:28,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:36:28,540 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:36:28,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:36:28,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:36:28,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:36:28,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:36:28,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:36:28,868 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:36:28,868 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-27 18:36:28,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe70a694/176f23212f7f4637bd58d136337ef164/FLAG1d7181eea [2019-12-27 18:36:29,569 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:36:29,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.opt.i [2019-12-27 18:36:29,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe70a694/176f23212f7f4637bd58d136337ef164/FLAG1d7181eea [2019-12-27 18:36:29,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe70a694/176f23212f7f4637bd58d136337ef164 [2019-12-27 18:36:29,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:36:29,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:36:29,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:36:29,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:36:29,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:36:29,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:29" (1/1) ... [2019-12-27 18:36:29,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d391672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:29, skipping insertion in model container [2019-12-27 18:36:29,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:29" (1/1) ... [2019-12-27 18:36:29,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:36:29,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:36:30,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:36:30,378 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:36:30,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:36:30,584 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:36:30,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30 WrapperNode [2019-12-27 18:36:30,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:36:30,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:36:30,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:36:30,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:36:30,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:36:30,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:36:30,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:36:30,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:36:30,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:36:30,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:36:30,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:36:30,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:36:30,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:36:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:36:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:36:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:36:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:36:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:36:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:36:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:36:30,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:36:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:36:30,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:36:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:36:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:36:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:36:30,769 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 18:36:31,505 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:36:31,505 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:36:31,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:31 BoogieIcfgContainer [2019-12-27 18:36:31,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:36:31,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:36:31,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:36:31,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:36:31,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:36:29" (1/3) ... [2019-12-27 18:36:31,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2323bb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:31, skipping insertion in model container [2019-12-27 18:36:31,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (2/3) ... [2019-12-27 18:36:31,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2323bb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:31, skipping insertion in model container [2019-12-27 18:36:31,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:31" (3/3) ... [2019-12-27 18:36:31,521 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.opt.i [2019-12-27 18:36:31,532 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:36:31,532 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:36:31,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:36:31,546 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:36:31,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,651 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,652 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:36:31,710 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:36:31,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:36:31,711 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:36:31,711 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:36:31,711 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:36:31,711 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:36:31,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:36:31,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:36:31,729 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 18:36:31,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:36:31,840 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:36:31,840 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:36:31,856 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:36:31,881 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:36:31,960 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:36:31,960 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:36:31,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:36:31,998 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:36:31,999 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:36:37,596 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 18:36:37,724 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 18:36:37,750 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 18:36:37,750 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 18:36:37,753 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 18:36:49,467 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 18:36:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 18:36:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:36:49,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:36:49,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:36:49,478 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:36:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:36:49,484 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 18:36:49,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:36:49,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325276417] [2019-12-27 18:36:49,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:36:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:36:49,740 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:36:49,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325276417] [2019-12-27 18:36:49,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:36:49,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:36:49,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2070783883] [2019-12-27 18:36:49,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:36:49,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:36:49,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:36:49,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:36:49,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:36:49,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:36:49,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:36:49,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:36:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:36:49,792 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 18:36:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:36:51,117 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 18:36:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:36:51,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:36:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:36:54,165 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 18:36:54,166 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 18:36:54,168 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:36:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 18:37:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 18:37:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 18:37:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 18:37:01,837 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 18:37:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:01,837 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 18:37:01,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 18:37:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:37:01,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:01,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:01,847 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:37:01,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:01,847 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 18:37:01,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:01,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462839838] [2019-12-27 18:37:01,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:02,017 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:37:02,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462839838] [2019-12-27 18:37:02,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:02,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:02,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383085961] [2019-12-27 18:37:02,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:02,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:02,027 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:37:02,027 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:02,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:02,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:37:02,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:37:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:02,030 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 18:37:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:06,729 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 18:37:06,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:37:06,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:37:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:07,304 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 18:37:07,305 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 18:37:07,306 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:37:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 18:37:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 18:37:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 18:37:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 18:37:14,471 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 18:37:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:14,472 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 18:37:14,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:37:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 18:37:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:37:14,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:14,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:14,477 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:37:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 18:37:14,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:14,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631634700] [2019-12-27 18:37:14,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:14,556 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:37:14,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631634700] [2019-12-27 18:37:14,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:14,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:14,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048289888] [2019-12-27 18:37:14,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:14,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:14,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:37:14,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:14,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:14,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:37:14,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:37:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:14,561 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 18:37:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:14,674 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 18:37:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:37:14,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:37:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:14,719 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 18:37:14,720 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 18:37:14,720 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:37:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 18:37:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 18:37:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 18:37:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 18:37:15,233 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 18:37:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:15,234 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 18:37:15,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 18:37:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:37:15,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:15,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:15,237 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:37:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 18:37:15,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:15,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244038721] [2019-12-27 18:37:15,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:15,356 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:37:15,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244038721] [2019-12-27 18:37:15,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:15,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:15,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281667893] [2019-12-27 18:37:15,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:15,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:15,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:37:15,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:15,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:15,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:37:15,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:37:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:15,366 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 18:37:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:16,348 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 18:37:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:37:16,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:37:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:16,421 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 18:37:16,421 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 18:37:16,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:37:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 18:37:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 18:37:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 18:37:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 18:37:17,057 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 18:37:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:17,058 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 18:37:17,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:37:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 18:37:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:37:17,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:17,069 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:37:17,069 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:37:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 18:37:17,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:17,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114082761] [2019-12-27 18:37:17,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:17,294 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:37:17,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114082761] [2019-12-27 18:37:17,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:17,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:37:17,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [921289286] [2019-12-27 18:37:17,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:17,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:17,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 18:37:17,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:17,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:17,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:37:17,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:37:17,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:37:17,314 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 18:37:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:18,226 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 18:37:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:37:18,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:37:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:18,322 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 18:37:18,322 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 18:37:18,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:37:20,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 18:37:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 18:37:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 18:37:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 18:37:20,607 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 18:37:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:20,608 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 18:37:20,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:37:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 18:37:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:37:20,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:20,625 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:37:20,625 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:37:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 18:37:20,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:20,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603542678] [2019-12-27 18:37:20,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:20,671 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:37:20,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603542678] [2019-12-27 18:37:20,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:20,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:20,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [293214675] [2019-12-27 18:37:20,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:20,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:20,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:37:20,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:20,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:20,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:37:20,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:37:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:20,683 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 18:37:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:20,765 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 18:37:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:37:20,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:37:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:20,791 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 18:37:20,791 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 18:37:20,792 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:37:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 18:37:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 18:37:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 18:37:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 18:37:21,003 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 18:37:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:21,004 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 18:37:21,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:37:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 18:37:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:37:21,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:21,025 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:37:21,026 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:37:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 18:37:21,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:21,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257584902] [2019-12-27 18:37:21,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:37:21,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257584902] [2019-12-27 18:37:21,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:21,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:37:21,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782441259] [2019-12-27 18:37:21,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:21,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:21,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 187 transitions. [2019-12-27 18:37:21,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:21,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:21,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:37:21,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:37:21,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:21,168 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 18:37:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:21,242 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 18:37:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:37:21,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 18:37:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:21,262 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 18:37:21,262 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 18:37:21,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 18:37:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 18:37:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 18:37:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 18:37:21,442 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 18:37:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:21,443 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 18:37:21,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:37:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 18:37:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:21,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:21,461 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] [2019-12-27 18:37:21,461 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:37:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 18:37:21,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:21,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594995001] [2019-12-27 18:37:21,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:21,540 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:37:21,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594995001] [2019-12-27 18:37:21,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:21,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:21,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955115121] [2019-12-27 18:37:21,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:21,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:22,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 471 transitions. [2019-12-27 18:37:22,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:22,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:37:22,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:37:22,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:37:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:37:22,135 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 7 states. [2019-12-27 18:37:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:22,626 INFO L93 Difference]: Finished difference Result 25197 states and 77861 transitions. [2019-12-27 18:37:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:37:22,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 18:37:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:22,647 INFO L225 Difference]: With dead ends: 25197 [2019-12-27 18:37:22,647 INFO L226 Difference]: Without dead ends: 13995 [2019-12-27 18:37:22,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:37:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2019-12-27 18:37:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 9365. [2019-12-27 18:37:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 18:37:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 18:37:22,825 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 18:37:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:22,825 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 18:37:22,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:37:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 18:37:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:22,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:22,839 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] [2019-12-27 18:37:22,839 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:37:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 18:37:22,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:22,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625567798] [2019-12-27 18:37:22,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:22,944 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:37:22,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625567798] [2019-12-27 18:37:22,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:22,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:22,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [769921130] [2019-12-27 18:37:22,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:22,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:23,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 393 transitions. [2019-12-27 18:37:23,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:23,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:37:23,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:37:23,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:23,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:37:23,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:37:23,272 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 8 states. [2019-12-27 18:37:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:23,724 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 18:37:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:37:23,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 18:37:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:23,759 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 18:37:23,760 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 18:37:23,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:37:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 18:37:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 18:37:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 18:37:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 18:37:24,082 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 18:37:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:24,083 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 18:37:24,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:37:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 18:37:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:24,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:24,109 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] [2019-12-27 18:37:24,109 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:37:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:24,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 18:37:24,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:24,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729351281] [2019-12-27 18:37:24,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:37:24,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729351281] [2019-12-27 18:37:24,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:24,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:24,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569028602] [2019-12-27 18:37:24,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:24,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:24,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 453 transitions. [2019-12-27 18:37:24,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:24,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:37:24,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:37:24,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:37:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:37:24,863 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 11 states. [2019-12-27 18:37:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:27,004 INFO L93 Difference]: Finished difference Result 32552 states and 100072 transitions. [2019-12-27 18:37:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:37:27,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:37:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:27,047 INFO L225 Difference]: With dead ends: 32552 [2019-12-27 18:37:27,047 INFO L226 Difference]: Without dead ends: 24064 [2019-12-27 18:37:27,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:37:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24064 states. [2019-12-27 18:37:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24064 to 13020. [2019-12-27 18:37:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 18:37:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 18:37:27,333 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 18:37:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:27,333 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 18:37:27,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:37:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 18:37:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:27,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:27,356 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] [2019-12-27 18:37:27,356 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:37:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 18:37:27,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:27,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531193011] [2019-12-27 18:37:27,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:27,443 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:37:27,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531193011] [2019-12-27 18:37:27,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:27,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:27,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1432253987] [2019-12-27 18:37:27,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:27,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:27,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:37:27,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:27,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:37:27,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:37:27,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:27,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:37:27,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:37:27,897 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 10 states. [2019-12-27 18:37:28,471 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-27 18:37:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:30,238 INFO L93 Difference]: Finished difference Result 54777 states and 170133 transitions. [2019-12-27 18:37:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:37:30,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 18:37:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:30,311 INFO L225 Difference]: With dead ends: 54777 [2019-12-27 18:37:30,311 INFO L226 Difference]: Without dead ends: 43609 [2019-12-27 18:37:30,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:37:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43609 states. [2019-12-27 18:37:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43609 to 15177. [2019-12-27 18:37:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15177 states. [2019-12-27 18:37:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15177 states to 15177 states and 47717 transitions. [2019-12-27 18:37:30,739 INFO L78 Accepts]: Start accepts. Automaton has 15177 states and 47717 transitions. Word has length 53 [2019-12-27 18:37:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:30,739 INFO L462 AbstractCegarLoop]: Abstraction has 15177 states and 47717 transitions. [2019-12-27 18:37:30,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:37:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 15177 states and 47717 transitions. [2019-12-27 18:37:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:30,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:30,756 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] [2019-12-27 18:37:30,756 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:37:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 18:37:30,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:30,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637891613] [2019-12-27 18:37:30,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:30,812 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:37:30,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637891613] [2019-12-27 18:37:30,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:30,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:30,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507678679] [2019-12-27 18:37:30,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:30,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:30,955 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:37:30,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:30,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:37:30,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:37:30,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:37:30,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:30,965 INFO L87 Difference]: Start difference. First operand 15177 states and 47717 transitions. Second operand 3 states. [2019-12-27 18:37:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:31,050 INFO L93 Difference]: Finished difference Result 20827 states and 65534 transitions. [2019-12-27 18:37:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:37:31,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:37:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:31,080 INFO L225 Difference]: With dead ends: 20827 [2019-12-27 18:37:31,080 INFO L226 Difference]: Without dead ends: 20827 [2019-12-27 18:37:31,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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:37:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20827 states. [2019-12-27 18:37:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20827 to 18999. [2019-12-27 18:37:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2019-12-27 18:37:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 60329 transitions. [2019-12-27 18:37:31,715 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 60329 transitions. Word has length 53 [2019-12-27 18:37:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:31,715 INFO L462 AbstractCegarLoop]: Abstraction has 18999 states and 60329 transitions. [2019-12-27 18:37:31,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 60329 transitions. [2019-12-27 18:37:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:31,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:31,736 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] [2019-12-27 18:37:31,736 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:37:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 18:37:31,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:31,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922238963] [2019-12-27 18:37:31,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:31,855 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:37:31,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922238963] [2019-12-27 18:37:31,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:31,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:31,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911302950] [2019-12-27 18:37:31,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:31,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:32,028 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 338 transitions. [2019-12-27 18:37:32,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:32,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:37:32,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:37:32,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:37:32,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:37:32,133 INFO L87 Difference]: Start difference. First operand 18999 states and 60329 transitions. Second operand 11 states. [2019-12-27 18:37:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:36,137 INFO L93 Difference]: Finished difference Result 63665 states and 197641 transitions. [2019-12-27 18:37:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 18:37:36,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:37:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:36,242 INFO L225 Difference]: With dead ends: 63665 [2019-12-27 18:37:36,243 INFO L226 Difference]: Without dead ends: 63581 [2019-12-27 18:37:36,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=566, Invalid=1786, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 18:37:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63581 states. [2019-12-27 18:37:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63581 to 22369. [2019-12-27 18:37:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22369 states. [2019-12-27 18:37:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22369 states to 22369 states and 70393 transitions. [2019-12-27 18:37:37,308 INFO L78 Accepts]: Start accepts. Automaton has 22369 states and 70393 transitions. Word has length 53 [2019-12-27 18:37:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:37,308 INFO L462 AbstractCegarLoop]: Abstraction has 22369 states and 70393 transitions. [2019-12-27 18:37:37,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:37:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 22369 states and 70393 transitions. [2019-12-27 18:37:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:37,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:37,345 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] [2019-12-27 18:37:37,346 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:37:37,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 18:37:37,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:37,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128442982] [2019-12-27 18:37:37,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:37,452 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:37:37,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128442982] [2019-12-27 18:37:37,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:37,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:37:37,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771563664] [2019-12-27 18:37:37,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:37,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:37,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 389 transitions. [2019-12-27 18:37:37,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:37,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:37:37,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:37:37,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:37:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:37:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:37:37,861 INFO L87 Difference]: Start difference. First operand 22369 states and 70393 transitions. Second operand 11 states. [2019-12-27 18:37:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:39,797 INFO L93 Difference]: Finished difference Result 39365 states and 120485 transitions. [2019-12-27 18:37:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:37:39,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:37:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:39,855 INFO L225 Difference]: With dead ends: 39365 [2019-12-27 18:37:39,855 INFO L226 Difference]: Without dead ends: 39243 [2019-12-27 18:37:39,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:37:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39243 states. [2019-12-27 18:37:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39243 to 28182. [2019-12-27 18:37:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28182 states. [2019-12-27 18:37:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28182 states to 28182 states and 87592 transitions. [2019-12-27 18:37:40,374 INFO L78 Accepts]: Start accepts. Automaton has 28182 states and 87592 transitions. Word has length 53 [2019-12-27 18:37:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:40,374 INFO L462 AbstractCegarLoop]: Abstraction has 28182 states and 87592 transitions. [2019-12-27 18:37:40,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:37:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28182 states and 87592 transitions. [2019-12-27 18:37:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:40,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:40,404 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] [2019-12-27 18:37:40,404 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:37:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 18:37:40,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:40,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229322918] [2019-12-27 18:37:40,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:40,545 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:37:40,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229322918] [2019-12-27 18:37:40,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:40,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:37:40,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686009434] [2019-12-27 18:37:40,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:40,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:40,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 313 transitions. [2019-12-27 18:37:40,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:37:41,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:37:41,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:37:41,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:37:41,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:37:41,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:37:41,155 INFO L87 Difference]: Start difference. First operand 28182 states and 87592 transitions. Second operand 13 states. [2019-12-27 18:37:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:44,521 INFO L93 Difference]: Finished difference Result 61696 states and 187701 transitions. [2019-12-27 18:37:44,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:37:44,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 18:37:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:44,619 INFO L225 Difference]: With dead ends: 61696 [2019-12-27 18:37:44,619 INFO L226 Difference]: Without dead ends: 61696 [2019-12-27 18:37:44,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 18:37:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61696 states. [2019-12-27 18:37:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61696 to 26700. [2019-12-27 18:37:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26700 states. [2019-12-27 18:37:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26700 states to 26700 states and 83274 transitions. [2019-12-27 18:37:45,339 INFO L78 Accepts]: Start accepts. Automaton has 26700 states and 83274 transitions. Word has length 53 [2019-12-27 18:37:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:45,339 INFO L462 AbstractCegarLoop]: Abstraction has 26700 states and 83274 transitions. [2019-12-27 18:37:45,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:37:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26700 states and 83274 transitions. [2019-12-27 18:37:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:45,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:45,373 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] [2019-12-27 18:37:45,373 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:37:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 18:37:45,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:45,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394389690] [2019-12-27 18:37:45,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:45,437 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:37:45,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394389690] [2019-12-27 18:37:45,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:45,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:45,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271284849] [2019-12-27 18:37:45,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:45,452 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:45,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 316 transitions. [2019-12-27 18:37:45,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:45,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:37:45,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:37:45,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:37:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:45,935 INFO L87 Difference]: Start difference. First operand 26700 states and 83274 transitions. Second operand 4 states. [2019-12-27 18:37:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:46,183 INFO L93 Difference]: Finished difference Result 26950 states and 81696 transitions. [2019-12-27 18:37:46,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:37:46,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 18:37:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:46,221 INFO L225 Difference]: With dead ends: 26950 [2019-12-27 18:37:46,221 INFO L226 Difference]: Without dead ends: 26950 [2019-12-27 18:37:46,221 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:37:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26950 states. [2019-12-27 18:37:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26950 to 19975. [2019-12-27 18:37:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19975 states. [2019-12-27 18:37:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19975 states to 19975 states and 61003 transitions. [2019-12-27 18:37:46,546 INFO L78 Accepts]: Start accepts. Automaton has 19975 states and 61003 transitions. Word has length 53 [2019-12-27 18:37:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:46,546 INFO L462 AbstractCegarLoop]: Abstraction has 19975 states and 61003 transitions. [2019-12-27 18:37:46,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:37:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 19975 states and 61003 transitions. [2019-12-27 18:37:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:37:46,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:46,566 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:37:46,566 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:37:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 18:37:46,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:46,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343909488] [2019-12-27 18:37:46,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:46,754 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:37:46,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343909488] [2019-12-27 18:37:46,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:46,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:37:46,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806344903] [2019-12-27 18:37:46,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:46,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:46,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 382 transitions. [2019-12-27 18:37:46,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:47,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:37:47,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 18:37:47,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 18:37:47,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:37:47,202 INFO L87 Difference]: Start difference. First operand 19975 states and 61003 transitions. Second operand 18 states. [2019-12-27 18:37:51,265 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-27 18:37:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:51,529 INFO L93 Difference]: Finished difference Result 51615 states and 156008 transitions. [2019-12-27 18:37:51,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 18:37:51,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-27 18:37:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:51,602 INFO L225 Difference]: With dead ends: 51615 [2019-12-27 18:37:51,602 INFO L226 Difference]: Without dead ends: 50565 [2019-12-27 18:37:51,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=888, Invalid=4812, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 18:37:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50565 states. [2019-12-27 18:37:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50565 to 25958. [2019-12-27 18:37:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25958 states. [2019-12-27 18:37:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 78699 transitions. [2019-12-27 18:37:52,113 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 78699 transitions. Word has length 54 [2019-12-27 18:37:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:52,113 INFO L462 AbstractCegarLoop]: Abstraction has 25958 states and 78699 transitions. [2019-12-27 18:37:52,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 18:37:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 78699 transitions. [2019-12-27 18:37:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:37:52,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:52,154 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:37:52,154 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:37:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 2 times [2019-12-27 18:37:52,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:52,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965138714] [2019-12-27 18:37:52,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:37:52,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965138714] [2019-12-27 18:37:52,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:52,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:37:52,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566098571] [2019-12-27 18:37:52,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:52,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:52,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 414 transitions. [2019-12-27 18:37:52,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:52,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:37:52,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:37:52,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:37:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:37:52,813 INFO L87 Difference]: Start difference. First operand 25958 states and 78699 transitions. Second operand 16 states. [2019-12-27 18:37:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:53,976 INFO L93 Difference]: Finished difference Result 40434 states and 122007 transitions. [2019-12-27 18:37:53,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 18:37:53,976 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 18:37:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:54,023 INFO L225 Difference]: With dead ends: 40434 [2019-12-27 18:37:54,023 INFO L226 Difference]: Without dead ends: 30252 [2019-12-27 18:37:54,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 12 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2019-12-27 18:37:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30252 states. [2019-12-27 18:37:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30252 to 19680. [2019-12-27 18:37:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19680 states. [2019-12-27 18:37:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19680 states to 19680 states and 59645 transitions. [2019-12-27 18:37:54,401 INFO L78 Accepts]: Start accepts. Automaton has 19680 states and 59645 transitions. Word has length 54 [2019-12-27 18:37:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:54,401 INFO L462 AbstractCegarLoop]: Abstraction has 19680 states and 59645 transitions. [2019-12-27 18:37:54,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:37:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 19680 states and 59645 transitions. [2019-12-27 18:37:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:37:54,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:54,424 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:37:54,424 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:37:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 3 times [2019-12-27 18:37:54,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:54,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682135506] [2019-12-27 18:37:54,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:54,473 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:37:54,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682135506] [2019-12-27 18:37:54,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:54,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:54,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53429567] [2019-12-27 18:37:54,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:54,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:54,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 317 transitions. [2019-12-27 18:37:54,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:54,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:54,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:37:54,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:37:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:54,924 INFO L87 Difference]: Start difference. First operand 19680 states and 59645 transitions. Second operand 3 states. [2019-12-27 18:37:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:55,045 INFO L93 Difference]: Finished difference Result 19678 states and 59640 transitions. [2019-12-27 18:37:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:37:55,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:37:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:55,088 INFO L225 Difference]: With dead ends: 19678 [2019-12-27 18:37:55,089 INFO L226 Difference]: Without dead ends: 19678 [2019-12-27 18:37:55,089 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:37:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19678 states. [2019-12-27 18:37:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19678 to 18042. [2019-12-27 18:37:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18042 states. [2019-12-27 18:37:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18042 states to 18042 states and 55161 transitions. [2019-12-27 18:37:55,538 INFO L78 Accepts]: Start accepts. Automaton has 18042 states and 55161 transitions. Word has length 54 [2019-12-27 18:37:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:55,538 INFO L462 AbstractCegarLoop]: Abstraction has 18042 states and 55161 transitions. [2019-12-27 18:37:55,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 18042 states and 55161 transitions. [2019-12-27 18:37:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:37:55,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:55,558 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:37:55,558 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:37:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 1 times [2019-12-27 18:37:55,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:55,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598452601] [2019-12-27 18:37:55,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:37:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:37:55,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:37:55,650 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:37:55,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24|)) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= 0 |v_ULTIMATE.start_main_~#t2354~0.offset_18|) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2354~0.base_24|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24| 1)) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24|) |v_ULTIMATE.start_main_~#t2354~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| 4)) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2354~0.offset=|v_ULTIMATE.start_main_~#t2354~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, ULTIMATE.start_main_~#t2354~0.base=|v_ULTIMATE.start_main_~#t2354~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_19|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_26|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2355~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2354~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2354~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2356~0.offset, ULTIMATE.start_main_~#t2355~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2356~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:37:55,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13|) |v_ULTIMATE.start_main_~#t2355~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t2355~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2355~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2355~0.base, #length, ULTIMATE.start_main_~#t2355~0.offset] because there is no mapped edge [2019-12-27 18:37:55,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2356~0.offset_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13|) |v_ULTIMATE.start_main_~#t2356~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13| 1) |v_#valid_38|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2356~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2356~0.offset] because there is no mapped edge [2019-12-27 18:37:55,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0_#in~arg.offset_In-2127492266| P1Thread1of1ForFork0_~arg.offset_Out-2127492266) (= ~x$w_buff1_used~0_Out-2127492266 ~x$w_buff0_used~0_In-2127492266) (= |P1Thread1of1ForFork0_#in~arg.base_In-2127492266| P1Thread1of1ForFork0_~arg.base_Out-2127492266) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2127492266| 1) (= ~x$w_buff0~0_Out-2127492266 1) (= ~x$w_buff0~0_In-2127492266 ~x$w_buff1~0_Out-2127492266) (= ~x$w_buff0_used~0_Out-2127492266 1) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2127492266| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2127492266) (= 0 (mod ~x$w_buff1_used~0_Out-2127492266 256))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2127492266, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-2127492266|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-2127492266|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-2127492266, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-2127492266, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-2127492266, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-2127492266, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-2127492266|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-2127492266|, ~x$w_buff1~0=~x$w_buff1~0_Out-2127492266, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-2127492266|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-2127492266, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-2127492266} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:37:55,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1421146484 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1421146484 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1421146484| ~x~0_In1421146484)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1421146484| ~x$w_buff1~0_In1421146484) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1421146484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1421146484, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1421146484, ~x~0=~x~0_In1421146484} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1421146484|, ~x$w_buff1~0=~x$w_buff1~0_In1421146484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1421146484, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1421146484, ~x~0=~x~0_In1421146484} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:37:55,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |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_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:37:55,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-2028361257 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-2028361257 256) 0))) (or (and (= ~x$w_buff0_used~0_In-2028361257 |P2Thread1of1ForFork1_#t~ite34_Out-2028361257|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-2028361257| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2028361257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-2028361257|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2028361257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:37:55,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-394282251 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-394282251 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-394282251| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-394282251| ~x$w_buff0_used~0_In-394282251) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-394282251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-394282251} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-394282251, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-394282251|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-394282251} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:37:55,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-1005939480 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1005939480 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1005939480 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1005939480 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1005939480|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1005939480 |P1Thread1of1ForFork0_#t~ite29_Out-1005939480|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1005939480, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1005939480, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1005939480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005939480} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1005939480, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1005939480, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1005939480, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1005939480|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005939480} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:37:55,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2000263135 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2000263135 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out2000263135)) (and (= ~x$r_buff0_thd2~0_In2000263135 ~x$r_buff0_thd2~0_Out2000263135) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2000263135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000263135} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2000263135|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2000263135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000263135} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:37:55,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1115745995 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1115745995 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1115745995 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1115745995 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1115745995| ~x$r_buff1_thd2~0_In1115745995) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out1115745995| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1115745995, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1115745995, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1115745995, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115745995} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1115745995|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115745995, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1115745995, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1115745995, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115745995} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:37:55,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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:37:55,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-297776403 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-297776403| |P0Thread1of1ForFork2_#t~ite12_Out-297776403|) (= |P0Thread1of1ForFork2_#t~ite11_Out-297776403| ~x$w_buff1~0_In-297776403) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-297776403 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-297776403 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-297776403 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-297776403 256) 0)))) (and (= |P0Thread1of1ForFork2_#t~ite12_Out-297776403| ~x$w_buff1~0_In-297776403) (= |P0Thread1of1ForFork2_#t~ite11_In-297776403| |P0Thread1of1ForFork2_#t~ite11_Out-297776403|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-297776403, ~x$w_buff1~0=~x$w_buff1~0_In-297776403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-297776403, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-297776403, ~weak$$choice2~0=~weak$$choice2~0_In-297776403, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-297776403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-297776403} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-297776403, ~x$w_buff1~0=~x$w_buff1~0_In-297776403, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-297776403, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-297776403, ~weak$$choice2~0=~weak$$choice2~0_In-297776403, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-297776403|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-297776403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-297776403} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:37:55,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-517751118 256) 0))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In-517751118 |P0Thread1of1ForFork2_#t~ite15_Out-517751118|) (= |P0Thread1of1ForFork2_#t~ite14_In-517751118| |P0Thread1of1ForFork2_#t~ite14_Out-517751118|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-517751118 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-517751118 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-517751118 256)) (and (= (mod ~x$w_buff1_used~0_In-517751118 256) 0) .cse1))) .cse0 (= ~x$w_buff0_used~0_In-517751118 |P0Thread1of1ForFork2_#t~ite14_Out-517751118|) (= |P0Thread1of1ForFork2_#t~ite14_Out-517751118| |P0Thread1of1ForFork2_#t~ite15_Out-517751118|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-517751118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-517751118, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-517751118, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-517751118|, ~weak$$choice2~0=~weak$$choice2~0_In-517751118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-517751118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-517751118, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-517751118|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-517751118, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-517751118|, ~weak$$choice2~0=~weak$$choice2~0_In-517751118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:37:55,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2115447728 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-2115447728| |P0Thread1of1ForFork2_#t~ite17_Out-2115447728|) (= ~x$w_buff1_used~0_In-2115447728 |P0Thread1of1ForFork2_#t~ite18_Out-2115447728|)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out-2115447728| |P0Thread1of1ForFork2_#t~ite17_Out-2115447728|) (= ~x$w_buff1_used~0_In-2115447728 |P0Thread1of1ForFork2_#t~ite17_Out-2115447728|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2115447728 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-2115447728 256)) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-2115447728 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-2115447728 256)))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2115447728, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-2115447728|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115447728, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115447728, ~weak$$choice2~0=~weak$$choice2~0_In-2115447728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2115447728} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2115447728, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-2115447728|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-2115447728|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115447728, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115447728, ~weak$$choice2~0=~weak$$choice2~0_In-2115447728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2115447728} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:37:55,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:37:55,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:37:55,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In230775093 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In230775093 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In230775093 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In230775093 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out230775093|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In230775093 |P2Thread1of1ForFork1_#t~ite35_Out230775093|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In230775093, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In230775093, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In230775093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230775093} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out230775093|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In230775093, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In230775093, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In230775093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In230775093} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:37:55,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2032191157 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2032191157 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-2032191157| ~x$r_buff0_thd3~0_In-2032191157) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-2032191157| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2032191157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2032191157} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2032191157|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2032191157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2032191157} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:37:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In371313697 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In371313697 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In371313697 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In371313697 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out371313697|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In371313697 |P2Thread1of1ForFork1_#t~ite37_Out371313697|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In371313697, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In371313697, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In371313697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371313697} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out371313697|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In371313697, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In371313697, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In371313697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In371313697} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:37:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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:37:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:37:55,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1997284569 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1997284569 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1997284569 |ULTIMATE.start_main_#t~ite41_Out1997284569|)) (and (= |ULTIMATE.start_main_#t~ite41_Out1997284569| ~x~0_In1997284569) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1997284569, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1997284569, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1997284569, ~x~0=~x~0_In1997284569} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1997284569|, ~x$w_buff1~0=~x$w_buff1~0_In1997284569, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1997284569, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1997284569, ~x~0=~x~0_In1997284569} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:37:55,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:37:55,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-927928633 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-927928633 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-927928633|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-927928633 |ULTIMATE.start_main_#t~ite43_Out-927928633|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-927928633, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-927928633} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-927928633, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-927928633|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-927928633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:37:55,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2120103463 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2120103463 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2120103463 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2120103463 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2120103463 |ULTIMATE.start_main_#t~ite44_Out2120103463|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite44_Out2120103463|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2120103463, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120103463, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2120103463, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120103463} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2120103463, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2120103463, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2120103463, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2120103463|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2120103463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:37:55,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1000955245 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1000955245 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1000955245|)) (and (= ~x$r_buff0_thd0~0_In-1000955245 |ULTIMATE.start_main_#t~ite45_Out-1000955245|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1000955245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1000955245} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1000955245, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1000955245|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1000955245} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:37:55,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-278105720 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-278105720 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-278105720 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-278105720 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-278105720| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out-278105720| ~x$r_buff1_thd0~0_In-278105720) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-278105720, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-278105720, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-278105720, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-278105720} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-278105720, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-278105720|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-278105720, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-278105720, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-278105720} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:37:55,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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:37:55,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:37:55 BasicIcfg [2019-12-27 18:37:55,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:37:55,742 INFO L168 Benchmark]: Toolchain (without parser) took 85933.30 ms. Allocated memory was 145.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 100.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:37:55,743 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 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:37:55,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.34 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 157.7 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:37:55,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:37:55,744 INFO L168 Benchmark]: Boogie Preprocessor took 44.95 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:37:55,745 INFO L168 Benchmark]: RCFGBuilder took 808.24 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 106.2 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:37:55,745 INFO L168 Benchmark]: TraceAbstraction took 84231.74 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 105.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 957.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:37:55,753 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.34 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 157.7 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.95 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.24 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 106.2 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84231.74 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.3 GB). Free memory was 105.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 957.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2354, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2355, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L777] 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_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L824] FCALL, FORK 0 pthread_create(&t2356, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, z=0] [L797] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z=1] [L741] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=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=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, 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=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 83.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4331 SDtfs, 7878 SDslu, 17455 SDs, 0 SdLazy, 12480 SolverSat, 527 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 138 SyntacticMatches, 74 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3719 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 220521 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 751 ConstructedInterpolants, 0 QuantifiedInterpolants, 128553 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...