/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:54:10,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:54:10,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:54:10,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:54:10,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:54:10,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:54:10,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:54:10,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:54:10,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:54:10,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:54:10,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:54:10,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:54:10,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:54:10,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:54:10,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:54:10,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:54:10,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:54:10,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:54:10,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:54:10,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:54:10,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:54:10,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:54:10,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:54:10,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:54:10,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:54:10,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:54:10,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:54:10,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:54:10,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:54:10,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:54:10,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:54:10,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:54:10,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:54:10,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:54:10,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:54:10,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:54:10,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:54:10,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:54:10,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:54:10,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:54:10,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:54:10,581 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-VariableLbe-MCR.epf [2019-12-27 21:54:10,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:54:10,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:54:10,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:54:10,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:54:10,597 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:54:10,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:54:10,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:54:10,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:54:10,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:54:10,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:54:10,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:54:10,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:54:10,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:54:10,599 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:54:10,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:54:10,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:54:10,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:54:10,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:54:10,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:54:10,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:54:10,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:54:10,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:54:10,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:54:10,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:54:10,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:54:10,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:54:10,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:54:10,602 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:54:10,602 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:54:10,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:54:10,603 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:54:10,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:54:10,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:54:10,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:54:10,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:54:10,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:54:10,909 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:54:10,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-27 21:54:10,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3366da5/354355b0103e4ed98ae9285d758e0e33/FLAG064621651 [2019-12-27 21:54:11,573 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:54:11,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-27 21:54:11,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3366da5/354355b0103e4ed98ae9285d758e0e33/FLAG064621651 [2019-12-27 21:54:11,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3366da5/354355b0103e4ed98ae9285d758e0e33 [2019-12-27 21:54:11,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:54:11,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:54:11,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:11,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:54:11,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:54:11,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:11" (1/1) ... [2019-12-27 21:54:11,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2840a5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:11, skipping insertion in model container [2019-12-27 21:54:11,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:11" (1/1) ... [2019-12-27 21:54:11,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:54:11,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:54:12,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:12,512 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:54:12,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:12,680 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:54:12,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12 WrapperNode [2019-12-27 21:54:12,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:12,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:12,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:54:12,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:54:12,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:12,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:54:12,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:54:12,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:54:12,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (1/1) ... [2019-12-27 21:54:12,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:54:12,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:54:12,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:54:12,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:54:12,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (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 21:54:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:54:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:54:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:54:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:54:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:54:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:54:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:54:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:54:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:54:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:54:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:54:12,861 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 21:54:13,503 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:54:13,504 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:54:13,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:13 BoogieIcfgContainer [2019-12-27 21:54:13,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:54:13,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:54:13,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:54:13,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:54:13,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:54:11" (1/3) ... [2019-12-27 21:54:13,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d17be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:13, skipping insertion in model container [2019-12-27 21:54:13,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:12" (2/3) ... [2019-12-27 21:54:13,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d17be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:13, skipping insertion in model container [2019-12-27 21:54:13,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:13" (3/3) ... [2019-12-27 21:54:13,519 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-27 21:54:13,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:54:13,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:54:13,542 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:54:13,543 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:54:13,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,582 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,606 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:13,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:54:13,667 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:54:13,667 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:54:13,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:54:13,690 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:54:13,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:54:13,691 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:54:13,691 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:54:13,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:54:13,708 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-27 21:54:13,710 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 21:54:13,793 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 21:54:13,794 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:13,809 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 21:54:13,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-27 21:54:13,867 INFO L132 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-27 21:54:13,868 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:13,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 0/125 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 21:54:13,885 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 21:54:13,886 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:54:17,017 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:54:17,152 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40940 [2019-12-27 21:54:17,152 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 21:54:17,156 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 77 transitions [2019-12-27 21:54:17,464 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 21:54:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 21:54:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:54:17,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:17,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:54:17,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash 679647889, now seen corresponding path program 1 times [2019-12-27 21:54:17,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:17,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42307182] [2019-12-27 21:54:17,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:17,772 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 21:54:17,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42307182] [2019-12-27 21:54:17,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:17,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:54:17,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126135136] [2019-12-27 21:54:17,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:17,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:17,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:54:17,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:17,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:17,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:17,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:17,820 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 21:54:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:18,112 INFO L93 Difference]: Finished difference Result 6202 states and 20974 transitions. [2019-12-27 21:54:18,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:18,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:54:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:18,178 INFO L225 Difference]: With dead ends: 6202 [2019-12-27 21:54:18,178 INFO L226 Difference]: Without dead ends: 5842 [2019-12-27 21:54:18,180 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 21:54:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5842 states. [2019-12-27 21:54:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5842 to 5842. [2019-12-27 21:54:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5842 states. [2019-12-27 21:54:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 19720 transitions. [2019-12-27 21:54:18,528 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 19720 transitions. Word has length 5 [2019-12-27 21:54:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:18,529 INFO L462 AbstractCegarLoop]: Abstraction has 5842 states and 19720 transitions. [2019-12-27 21:54:18,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 19720 transitions. [2019-12-27 21:54:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:54:18,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:18,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:18,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1194540122, now seen corresponding path program 1 times [2019-12-27 21:54:18,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:18,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730129059] [2019-12-27 21:54:18,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:18,636 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 21:54:18,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730129059] [2019-12-27 21:54:18,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:18,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:18,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379054453] [2019-12-27 21:54:18,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:18,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:18,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:54:18,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:18,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:18,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:18,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:18,647 INFO L87 Difference]: Start difference. First operand 5842 states and 19720 transitions. Second operand 3 states. [2019-12-27 21:54:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:18,675 INFO L93 Difference]: Finished difference Result 1186 states and 2950 transitions. [2019-12-27 21:54:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:18,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:54:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:18,683 INFO L225 Difference]: With dead ends: 1186 [2019-12-27 21:54:18,683 INFO L226 Difference]: Without dead ends: 1186 [2019-12-27 21:54:18,685 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 21:54:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-27 21:54:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-27 21:54:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-27 21:54:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2950 transitions. [2019-12-27 21:54:18,715 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2950 transitions. Word has length 11 [2019-12-27 21:54:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:18,715 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 2950 transitions. [2019-12-27 21:54:18,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2950 transitions. [2019-12-27 21:54:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:18,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:18,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:18,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:18,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1520947745, now seen corresponding path program 1 times [2019-12-27 21:54:18,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:18,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177619514] [2019-12-27 21:54:18,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:18,794 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 21:54:18,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177619514] [2019-12-27 21:54:18,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:18,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:18,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053055080] [2019-12-27 21:54:18,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:18,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:18,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:18,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:18,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:54:18,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:18,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:18,860 INFO L87 Difference]: Start difference. First operand 1186 states and 2950 transitions. Second operand 5 states. [2019-12-27 21:54:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:18,973 INFO L93 Difference]: Finished difference Result 1816 states and 4578 transitions. [2019-12-27 21:54:18,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:18,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:18,986 INFO L225 Difference]: With dead ends: 1816 [2019-12-27 21:54:18,986 INFO L226 Difference]: Without dead ends: 1816 [2019-12-27 21:54:18,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-27 21:54:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1300. [2019-12-27 21:54:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 21:54:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3290 transitions. [2019-12-27 21:54:19,035 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3290 transitions. Word has length 14 [2019-12-27 21:54:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:19,035 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3290 transitions. [2019-12-27 21:54:19,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3290 transitions. [2019-12-27 21:54:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:19,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:19,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:19,037 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:19,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:19,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1657479898, now seen corresponding path program 1 times [2019-12-27 21:54:19,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:19,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416968477] [2019-12-27 21:54:19,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:19,122 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 21:54:19,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416968477] [2019-12-27 21:54:19,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:19,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:19,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946785186] [2019-12-27 21:54:19,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:19,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:19,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:19,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:19,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:19,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:19,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:19,196 INFO L87 Difference]: Start difference. First operand 1300 states and 3290 transitions. Second operand 5 states. [2019-12-27 21:54:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:19,444 INFO L93 Difference]: Finished difference Result 1749 states and 4286 transitions. [2019-12-27 21:54:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:19,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:19,456 INFO L225 Difference]: With dead ends: 1749 [2019-12-27 21:54:19,457 INFO L226 Difference]: Without dead ends: 1749 [2019-12-27 21:54:19,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2019-12-27 21:54:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1581. [2019-12-27 21:54:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-12-27 21:54:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3910 transitions. [2019-12-27 21:54:19,502 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3910 transitions. Word has length 14 [2019-12-27 21:54:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:19,506 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3910 transitions. [2019-12-27 21:54:19,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3910 transitions. [2019-12-27 21:54:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:54:19,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:19,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:54:19,509 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 592134812, now seen corresponding path program 1 times [2019-12-27 21:54:19,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:19,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481574398] [2019-12-27 21:54:19,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:19,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481574398] [2019-12-27 21:54:19,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:19,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:19,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618274855] [2019-12-27 21:54:19,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:19,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:19,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 21:54:19,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:19,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:19,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:19,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:19,605 INFO L87 Difference]: Start difference. First operand 1581 states and 3910 transitions. Second operand 5 states. [2019-12-27 21:54:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:19,784 INFO L93 Difference]: Finished difference Result 2006 states and 4872 transitions. [2019-12-27 21:54:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:54:19,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:54:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:19,796 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 21:54:19,797 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 21:54:19,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:54:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 21:54:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1606. [2019-12-27 21:54:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-27 21:54:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 3970 transitions. [2019-12-27 21:54:19,837 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 3970 transitions. Word has length 14 [2019-12-27 21:54:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:19,837 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 3970 transitions. [2019-12-27 21:54:19,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 3970 transitions. [2019-12-27 21:54:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:54:19,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:19,840 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] [2019-12-27 21:54:19,841 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash -321167057, now seen corresponding path program 1 times [2019-12-27 21:54:19,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:19,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695041273] [2019-12-27 21:54:19,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:19,884 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 21:54:19,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695041273] [2019-12-27 21:54:19,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:19,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:54:19,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073488369] [2019-12-27 21:54:19,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:19,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:19,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 21:54:19,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:19,919 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:54:19,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:54:19,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:19,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:54:19,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:19,920 INFO L87 Difference]: Start difference. First operand 1606 states and 3970 transitions. Second operand 5 states. [2019-12-27 21:54:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:19,954 INFO L93 Difference]: Finished difference Result 714 states and 1648 transitions. [2019-12-27 21:54:19,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:54:19,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:54:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:19,959 INFO L225 Difference]: With dead ends: 714 [2019-12-27 21:54:19,959 INFO L226 Difference]: Without dead ends: 714 [2019-12-27 21:54:19,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:54:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-27 21:54:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 682. [2019-12-27 21:54:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-27 21:54:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1580 transitions. [2019-12-27 21:54:19,974 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1580 transitions. Word has length 26 [2019-12-27 21:54:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:19,974 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1580 transitions. [2019-12-27 21:54:19,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:54:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1580 transitions. [2019-12-27 21:54:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:19,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:19,977 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] [2019-12-27 21:54:19,977 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash 152096728, now seen corresponding path program 1 times [2019-12-27 21:54:19,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:19,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389835366] [2019-12-27 21:54:19,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:20,086 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 21:54:20,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389835366] [2019-12-27 21:54:20,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:20,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:20,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910938663] [2019-12-27 21:54:20,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:20,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:20,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 157 transitions. [2019-12-27 21:54:20,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:20,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:54:20,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:20,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:20,194 INFO L87 Difference]: Start difference. First operand 682 states and 1580 transitions. Second operand 3 states. [2019-12-27 21:54:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:20,208 INFO L93 Difference]: Finished difference Result 1069 states and 2520 transitions. [2019-12-27 21:54:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:20,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 21:54:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:20,211 INFO L225 Difference]: With dead ends: 1069 [2019-12-27 21:54:20,211 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 21:54:20,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 21:54:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-27 21:54:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 21:54:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 971 transitions. [2019-12-27 21:54:20,230 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 971 transitions. Word has length 41 [2019-12-27 21:54:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:20,230 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 971 transitions. [2019-12-27 21:54:20,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 971 transitions. [2019-12-27 21:54:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:20,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:20,232 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] [2019-12-27 21:54:20,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash -927493450, now seen corresponding path program 2 times [2019-12-27 21:54:20,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:20,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099179067] [2019-12-27 21:54:20,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:20,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099179067] [2019-12-27 21:54:20,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:20,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:54:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266521970] [2019-12-27 21:54:20,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:20,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:20,362 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 150 transitions. [2019-12-27 21:54:20,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:20,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:54:20,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:54:20,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:20,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:54:20,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:20,476 INFO L87 Difference]: Start difference. First operand 406 states and 971 transitions. Second operand 10 states. [2019-12-27 21:54:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:21,972 INFO L93 Difference]: Finished difference Result 1686 states and 3762 transitions. [2019-12-27 21:54:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 21:54:21,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-12-27 21:54:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:21,979 INFO L225 Difference]: With dead ends: 1686 [2019-12-27 21:54:21,979 INFO L226 Difference]: Without dead ends: 1138 [2019-12-27 21:54:21,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:54:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-12-27 21:54:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 436. [2019-12-27 21:54:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 21:54:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1021 transitions. [2019-12-27 21:54:21,995 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1021 transitions. Word has length 41 [2019-12-27 21:54:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:21,996 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 1021 transitions. [2019-12-27 21:54:21,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:54:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1021 transitions. [2019-12-27 21:54:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:21,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:21,998 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] [2019-12-27 21:54:21,998 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1094693734, now seen corresponding path program 3 times [2019-12-27 21:54:21,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:22,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716336973] [2019-12-27 21:54:22,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:22,155 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 21:54:22,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716336973] [2019-12-27 21:54:22,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:22,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:54:22,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723590046] [2019-12-27 21:54:22,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:22,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:22,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 103 transitions. [2019-12-27 21:54:22,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:22,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:54:22,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:54:22,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:22,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:54:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:54:22,468 INFO L87 Difference]: Start difference. First operand 436 states and 1021 transitions. Second operand 16 states. [2019-12-27 21:54:25,386 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-27 21:54:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:26,381 INFO L93 Difference]: Finished difference Result 1344 states and 2763 transitions. [2019-12-27 21:54:26,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 21:54:26,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-12-27 21:54:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:26,389 INFO L225 Difference]: With dead ends: 1344 [2019-12-27 21:54:26,389 INFO L226 Difference]: Without dead ends: 1344 [2019-12-27 21:54:26,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 21:54:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2019-12-27 21:54:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 679. [2019-12-27 21:54:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-12-27 21:54:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1481 transitions. [2019-12-27 21:54:26,409 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1481 transitions. Word has length 41 [2019-12-27 21:54:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:26,409 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 1481 transitions. [2019-12-27 21:54:26,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:54:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1481 transitions. [2019-12-27 21:54:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:26,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:26,411 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] [2019-12-27 21:54:26,411 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:26,412 INFO L82 PathProgramCache]: Analyzing trace with hash -924340920, now seen corresponding path program 4 times [2019-12-27 21:54:26,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:26,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438478172] [2019-12-27 21:54:26,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:26,489 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 21:54:26,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438478172] [2019-12-27 21:54:26,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:26,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:54:26,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1814220689] [2019-12-27 21:54:26,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:26,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:26,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 93 transitions. [2019-12-27 21:54:26,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:26,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:54:26,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:54:26,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:26,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:54:26,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:54:26,548 INFO L87 Difference]: Start difference. First operand 679 states and 1481 transitions. Second operand 9 states. [2019-12-27 21:54:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:27,333 INFO L93 Difference]: Finished difference Result 2784 states and 5871 transitions. [2019-12-27 21:54:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:54:27,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 21:54:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:27,344 INFO L225 Difference]: With dead ends: 2784 [2019-12-27 21:54:27,344 INFO L226 Difference]: Without dead ends: 2066 [2019-12-27 21:54:27,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:54:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-12-27 21:54:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 691. [2019-12-27 21:54:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-27 21:54:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1521 transitions. [2019-12-27 21:54:27,378 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1521 transitions. Word has length 41 [2019-12-27 21:54:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:27,380 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1521 transitions. [2019-12-27 21:54:27,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:54:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1521 transitions. [2019-12-27 21:54:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:27,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:27,383 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] [2019-12-27 21:54:27,384 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 318757224, now seen corresponding path program 5 times [2019-12-27 21:54:27,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:27,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822295552] [2019-12-27 21:54:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:27,552 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 21:54:27,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822295552] [2019-12-27 21:54:27,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:27,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:54:27,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237356093] [2019-12-27 21:54:27,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:27,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:27,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 153 transitions. [2019-12-27 21:54:27,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:27,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:54:27,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:54:27,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:27,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:54:27,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:54:27,660 INFO L87 Difference]: Start difference. First operand 691 states and 1521 transitions. Second operand 7 states. [2019-12-27 21:54:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:28,282 INFO L93 Difference]: Finished difference Result 1133 states and 2437 transitions. [2019-12-27 21:54:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:54:28,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 21:54:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:28,287 INFO L225 Difference]: With dead ends: 1133 [2019-12-27 21:54:28,287 INFO L226 Difference]: Without dead ends: 1133 [2019-12-27 21:54:28,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:54:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-12-27 21:54:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 757. [2019-12-27 21:54:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-12-27 21:54:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1664 transitions. [2019-12-27 21:54:28,304 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1664 transitions. Word has length 41 [2019-12-27 21:54:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:28,304 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1664 transitions. [2019-12-27 21:54:28,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:54:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1664 transitions. [2019-12-27 21:54:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:54:28,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:28,306 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] [2019-12-27 21:54:28,306 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1915123108, now seen corresponding path program 6 times [2019-12-27 21:54:28,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:28,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781696088] [2019-12-27 21:54:28,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:28,382 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 21:54:28,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781696088] [2019-12-27 21:54:28,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:28,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:54:28,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342150454] [2019-12-27 21:54:28,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:28,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:28,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 101 transitions. [2019-12-27 21:54:28,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:28,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:28,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:28,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:28,425 INFO L87 Difference]: Start difference. First operand 757 states and 1664 transitions. Second operand 3 states. [2019-12-27 21:54:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:28,439 INFO L93 Difference]: Finished difference Result 755 states and 1659 transitions. [2019-12-27 21:54:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:28,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 21:54:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:28,441 INFO L225 Difference]: With dead ends: 755 [2019-12-27 21:54:28,441 INFO L226 Difference]: Without dead ends: 755 [2019-12-27 21:54:28,442 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 21:54:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-27 21:54:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 545. [2019-12-27 21:54:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-12-27 21:54:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1188 transitions. [2019-12-27 21:54:28,454 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1188 transitions. Word has length 41 [2019-12-27 21:54:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:54:28,455 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 1188 transitions. [2019-12-27 21:54:28,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:54:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1188 transitions. [2019-12-27 21:54:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:54:28,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:28,456 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] [2019-12-27 21:54:28,456 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash 563396780, now seen corresponding path program 1 times [2019-12-27 21:54:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:28,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674756232] [2019-12-27 21:54:28,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:54:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:54:28,620 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:54:28,620 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:54:28,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$w_buff1~0_23) (= v_~main$tmp_guard0~0_9 0) (= v_~x$r_buff1_thd1~0_40 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_23|)) (= 0 v_~x$r_buff0_thd2~0_29) (= 0 v_~x$r_buff0_thd1~0_69) (= 0 v_~x$r_buff0_thd0~0_21) (= |v_ULTIMATE.start_main_~#t1635~0.offset_18| 0) (= 0 v_~x$w_buff0~0_24) (= v_~y~0_19 0) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_25 0) (= v_~x$w_buff1_used~0_54 0) (= 0 v_~x$w_buff0_used~0_92) (= v_~x$r_buff1_thd2~0_21 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_23| 4)) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_23|) (= v_~x~0_20 0) (= v_~x$flush_delayed~0_12 0) (= v_~main$tmp_guard1~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_23| 1) |v_#valid_47|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_18 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_23|) |v_ULTIMATE.start_main_~#t1635~0.offset_18| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_69, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_40, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_23|, #length=|v_#length_17|, ~y~0=v_~y~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_23|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_54, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_25, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_92, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_23|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1635~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:54:28,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-12-27 21:54:28,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L5-->L777: Formula: (and (= ~__unbuffered_p1_EAX~0_Out-766942106 ~y~0_Out-766942106) (= ~x$r_buff1_thd1~0_Out-766942106 ~x$r_buff0_thd1~0_In-766942106) (= 1 ~x$r_buff0_thd2~0_Out-766942106) (= ~__unbuffered_p1_EBX~0_Out-766942106 ~y~0_Out-766942106) (= ~x$r_buff1_thd0~0_Out-766942106 ~x$r_buff0_thd0~0_In-766942106) (= 1 ~y~0_Out-766942106) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-766942106 0)) (= ~x$r_buff1_thd2~0_Out-766942106 ~x$r_buff0_thd2~0_In-766942106)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-766942106, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-766942106, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-766942106, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766942106} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-766942106, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-766942106, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-766942106, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-766942106, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-766942106, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-766942106, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-766942106, ~y~0=~y~0_Out-766942106, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-766942106, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-766942106} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:54:28,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_37) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 21:54:28,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In227012096 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite22_In227012096| |P0Thread1of1ForFork1_#t~ite22_Out227012096|) (= |P0Thread1of1ForFork1_#t~ite24_Out227012096| ~x$r_buff1_thd1~0_In227012096) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite23_In227012096| |P0Thread1of1ForFork1_#t~ite23_Out227012096|)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In227012096 256) 0)))) (and (or .cse1 (not (= 0 (mod ~x$r_buff1_thd1~0_In227012096 256)))) (= |P0Thread1of1ForFork1_#t~ite24_Out227012096| |P0Thread1of1ForFork1_#t~ite23_Out227012096|) (= |P0Thread1of1ForFork1_#t~ite23_Out227012096| |P0Thread1of1ForFork1_#t~ite22_Out227012096|) .cse0 (not (= 0 (mod ~x$w_buff0_used~0_In227012096 256))) (or (not (= (mod ~x$w_buff1_used~0_In227012096 256) 0)) .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out227012096|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In227012096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In227012096, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In227012096, ~weak$$choice2~0=~weak$$choice2~0_In227012096, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In227012096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In227012096, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In227012096|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In227012096, ~x$w_buff1_used~0=~x$w_buff1_used~0_In227012096, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In227012096, ~weak$$choice2~0=~weak$$choice2~0_In227012096, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out227012096|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out227012096|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out227012096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In227012096} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 21:54:28,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 21:54:28,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1907504276 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1907504276 256)))) (or (and (= ~x$w_buff0_used~0_In1907504276 |P1Thread1of1ForFork0_#t~ite28_Out1907504276|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1907504276|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1907504276, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1907504276} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1907504276, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1907504276|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1907504276} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 21:54:28,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In931638026 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In931638026 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In931638026 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In931638026 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out931638026| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out931638026| ~x$w_buff1_used~0_In931638026)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In931638026, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In931638026, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In931638026, ~x$w_buff0_used~0=~x$w_buff0_used~0_In931638026} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In931638026, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In931638026, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In931638026, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out931638026|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In931638026} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 21:54:28,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-995695929 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-995695929 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-995695929 ~x$r_buff0_thd2~0_In-995695929) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out-995695929 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-995695929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-995695929} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-995695929|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-995695929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-995695929} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:54:28,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1179006073 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1179006073 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1179006073 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1179006073 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-1179006073| ~x$r_buff1_thd2~0_In-1179006073)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1179006073| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1179006073, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1179006073, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1179006073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179006073} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1179006073|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1179006073, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1179006073, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1179006073, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1179006073} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:54:28,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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 21:54:28,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:54:28,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In2131464447 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2131464447 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In2131464447 |ULTIMATE.start_main_#t~ite34_Out2131464447|) (not .cse1)) (and (= ~x~0_In2131464447 |ULTIMATE.start_main_#t~ite34_Out2131464447|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2131464447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131464447, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131464447, ~x~0=~x~0_In2131464447} OutVars{~x$w_buff1~0=~x$w_buff1~0_In2131464447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131464447, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131464447, ~x~0=~x~0_In2131464447, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2131464447|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:54:28,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:54:28,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-907383696 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-907383696 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-907383696| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-907383696| ~x$w_buff0_used~0_In-907383696) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-907383696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-907383696} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-907383696, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-907383696|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-907383696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:54:28,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In975994070 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In975994070 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In975994070 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In975994070 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite37_Out975994070|)) (and (= ~x$w_buff1_used~0_In975994070 |ULTIMATE.start_main_#t~ite37_Out975994070|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In975994070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975994070, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975994070, ~x$w_buff0_used~0=~x$w_buff0_used~0_In975994070} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In975994070, ~x$w_buff1_used~0=~x$w_buff1_used~0_In975994070, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out975994070|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In975994070, ~x$w_buff0_used~0=~x$w_buff0_used~0_In975994070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:54:28,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-882695018 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-882695018 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-882695018|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-882695018 |ULTIMATE.start_main_#t~ite38_Out-882695018|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-882695018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-882695018} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-882695018, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-882695018|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-882695018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:54:28,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In742937445 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In742937445 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In742937445 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In742937445 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out742937445| ~x$r_buff1_thd0~0_In742937445)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out742937445| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In742937445, ~x$w_buff1_used~0=~x$w_buff1_used~0_In742937445, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In742937445, ~x$w_buff0_used~0=~x$w_buff0_used~0_In742937445} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In742937445, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out742937445|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In742937445, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In742937445, ~x$w_buff0_used~0=~x$w_buff0_used~0_In742937445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:54:28,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 1 v_~__unbuffered_p1_EAX~0_11) (= v_~__unbuffered_p1_EBX~0_12 1) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite39_14|) (= v_~y~0_13 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ~y~0=v_~y~0_13} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:54:28,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:54:28 BasicIcfg [2019-12-27 21:54:28,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:54:28,782 INFO L168 Benchmark]: Toolchain (without parser) took 16913.84 ms. Allocated memory was 144.2 MB in the beginning and 447.7 MB in the end (delta: 303.6 MB). Free memory was 100.2 MB in the beginning and 114.6 MB in the end (delta: -14.4 MB). Peak memory consumption was 289.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,782 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.50 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 154.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.45 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,787 INFO L168 Benchmark]: Boogie Preprocessor took 34.84 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,788 INFO L168 Benchmark]: RCFGBuilder took 722.83 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 108.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,788 INFO L168 Benchmark]: TraceAbstraction took 15269.78 ms. Allocated memory was 201.9 MB in the beginning and 447.7 MB in the end (delta: 245.9 MB). Free memory was 108.1 MB in the beginning and 114.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 239.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:28,796 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.17 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.50 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 154.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.45 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.84 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 722.83 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 108.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15269.78 ms. Allocated memory was 201.9 MB in the beginning and 447.7 MB in the end (delta: 245.9 MB). Free memory was 108.1 MB in the beginning and 114.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 239.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 136 ProgramPointsBefore, 66 ProgramPointsAfterwards, 164 TransitionsBefore, 77 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 123 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 40940 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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) [L737] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 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)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_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)) [L739] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 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)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 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)) [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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 [L808] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 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 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1359 SDtfs, 2139 SDslu, 3720 SDs, 0 SdLazy, 3933 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 4444 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 35342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...