/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:08:18,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:08:18,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:08:18,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:08:18,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:08:18,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:08:18,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:08:18,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:08:18,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:08:18,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:08:18,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:08:18,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:08:18,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:08:18,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:08:18,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:08:18,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:08:18,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:08:18,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:08:18,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:08:18,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:08:18,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:08:18,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:08:18,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:08:18,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:08:18,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:08:18,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:08:18,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:08:18,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:08:18,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:08:18,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:08:18,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:08:18,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:08:18,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:08:18,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:08:18,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:08:18,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:08:18,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:08:18,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:08:18,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:08:18,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:08:18,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:08:18,577 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.epf [2019-12-27 07:08:18,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:08:18,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:08:18,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:08:18,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:08:18,592 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:08:18,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:08:18,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:08:18,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:08:18,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:08:18,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:08:18,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:08:18,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:08:18,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:08:18,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:08:18,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:08:18,594 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:08:18,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:08:18,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:08:18,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:08:18,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:08:18,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:08:18,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:08:18,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:08:18,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:08:18,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:08:18,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:08:18,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:08:18,597 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:08:18,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:08:18,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:08:18,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:08:18,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:08:18,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:08:18,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:08:18,908 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:08:18,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i [2019-12-27 07:08:18,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3035030c/b1e4bc2cc747456f89bd4f0b8b55a1b6/FLAGf1366bf49 [2019-12-27 07:08:19,550 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:08:19,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.opt.i [2019-12-27 07:08:19,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3035030c/b1e4bc2cc747456f89bd4f0b8b55a1b6/FLAGf1366bf49 [2019-12-27 07:08:19,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3035030c/b1e4bc2cc747456f89bd4f0b8b55a1b6 [2019-12-27 07:08:19,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:08:19,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:08:19,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:19,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:08:19,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:08:19,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:19" (1/1) ... [2019-12-27 07:08:19,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b63b91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:19, skipping insertion in model container [2019-12-27 07:08:19,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:19" (1/1) ... [2019-12-27 07:08:19,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:08:19,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:08:20,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:20,495 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:08:20,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:20,660 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:08:20,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20 WrapperNode [2019-12-27 07:08:20,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:20,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:20,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:08:20,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:08:20,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:20,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:08:20,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:08:20,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:08:20,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:08:20,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:08:20,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:08:20,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:08:20,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (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 07:08:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:08:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:08:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:08:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:08:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:08:20,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:08:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:08:20,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:08:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:08:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:08:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:08:20,849 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 07:08:21,571 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:08:21,572 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:08:21,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:21 BoogieIcfgContainer [2019-12-27 07:08:21,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:08:21,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:08:21,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:08:21,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:08:21,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:08:19" (1/3) ... [2019-12-27 07:08:21,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1f14e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:21, skipping insertion in model container [2019-12-27 07:08:21,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20" (2/3) ... [2019-12-27 07:08:21,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1f14e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:21, skipping insertion in model container [2019-12-27 07:08:21,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:21" (3/3) ... [2019-12-27 07:08:21,582 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt.i [2019-12-27 07:08:21,592 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:08:21,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:08:21,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:08:21,602 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:08:21,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,666 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,666 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,676 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,683 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:21,706 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:08:21,743 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:08:21,745 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:08:21,745 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:08:21,745 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:08:21,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:08:21,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:08:21,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:08:21,747 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:08:21,770 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 07:08:21,772 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:21,853 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:21,853 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:21,866 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:21,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:21,942 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:21,942 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:21,949 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:21,964 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 07:08:21,965 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:08:24,927 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:08:25,070 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:08:25,126 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-27 07:08:25,127 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 07:08:25,130 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-27 07:08:25,514 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-27 07:08:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-27 07:08:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:08:25,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:25,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:08:25,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-27 07:08:25,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:25,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404274801] [2019-12-27 07:08:25,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:25,746 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 07:08:25,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404274801] [2019-12-27 07:08:25,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:25,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:25,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262057050] [2019-12-27 07:08:25,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:25,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:25,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:25,776 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-27 07:08:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:26,114 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-27 07:08:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:26,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:08:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:26,242 INFO L225 Difference]: With dead ends: 6863 [2019-12-27 07:08:26,243 INFO L226 Difference]: Without dead ends: 6460 [2019-12-27 07:08:26,244 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 07:08:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-27 07:08:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-27 07:08:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-27 07:08:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-27 07:08:26,615 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-27 07:08:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:26,616 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-27 07:08:26,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-27 07:08:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:08:26,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:26,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:26,621 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-27 07:08:26,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:26,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109850804] [2019-12-27 07:08:26,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:26,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 07:08:26,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109850804] [2019-12-27 07:08:26,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:26,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:26,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957220183] [2019-12-27 07:08:26,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:26,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:26,777 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-27 07:08:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:27,204 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-27 07:08:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:27,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:08:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:27,410 INFO L225 Difference]: With dead ends: 9760 [2019-12-27 07:08:27,416 INFO L226 Difference]: Without dead ends: 9746 [2019-12-27 07:08:27,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-27 07:08:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-27 07:08:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-27 07:08:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-27 07:08:27,802 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-27 07:08:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:27,802 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-27 07:08:27,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-27 07:08:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:27,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:27,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:27,808 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:27,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-27 07:08:27,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:27,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713269449] [2019-12-27 07:08:27,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:27,856 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 07:08:27,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713269449] [2019-12-27 07:08:27,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:27,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:27,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596707341] [2019-12-27 07:08:27,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:27,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:27,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:27,858 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-27 07:08:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:27,970 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-27 07:08:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:27,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:08:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:28,014 INFO L225 Difference]: With dead ends: 12018 [2019-12-27 07:08:28,015 INFO L226 Difference]: Without dead ends: 12018 [2019-12-27 07:08:28,015 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 07:08:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-27 07:08:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-27 07:08:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-27 07:08:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-27 07:08:28,983 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-27 07:08:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:28,989 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-27 07:08:28,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-27 07:08:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:28,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:28,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:28,995 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-27 07:08:28,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:28,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122397389] [2019-12-27 07:08:28,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:29,132 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 07:08:29,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122397389] [2019-12-27 07:08:29,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:29,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:29,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550026835] [2019-12-27 07:08:29,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:29,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:29,138 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-27 07:08:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:29,374 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-27 07:08:29,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:29,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:29,420 INFO L225 Difference]: With dead ends: 13296 [2019-12-27 07:08:29,420 INFO L226 Difference]: Without dead ends: 13285 [2019-12-27 07:08:29,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-27 07:08:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-27 07:08:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-27 07:08:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-27 07:08:29,924 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-27 07:08:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:29,925 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-27 07:08:29,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-27 07:08:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:29,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:29,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:29,929 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-27 07:08:29,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:29,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513484983] [2019-12-27 07:08:29,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:29,986 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 07:08:29,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513484983] [2019-12-27 07:08:29,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:29,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:29,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670069179] [2019-12-27 07:08:29,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:29,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:29,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:29,989 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-27 07:08:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:30,210 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-27 07:08:30,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:30,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:30,296 INFO L225 Difference]: With dead ends: 14351 [2019-12-27 07:08:30,296 INFO L226 Difference]: Without dead ends: 14338 [2019-12-27 07:08:30,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-27 07:08:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-27 07:08:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-27 07:08:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-27 07:08:30,828 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-27 07:08:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:30,829 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-27 07:08:30,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-27 07:08:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:08:30,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:30,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:30,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:30,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-27 07:08:30,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:30,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103595991] [2019-12-27 07:08:30,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:30,876 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 07:08:30,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103595991] [2019-12-27 07:08:30,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:30,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:30,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094087484] [2019-12-27 07:08:30,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:30,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:30,878 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-27 07:08:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:30,934 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-27 07:08:30,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:30,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:08:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:31,002 INFO L225 Difference]: With dead ends: 12224 [2019-12-27 07:08:31,003 INFO L226 Difference]: Without dead ends: 12224 [2019-12-27 07:08:31,003 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 07:08:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-27 07:08:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-27 07:08:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-27 07:08:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-27 07:08:32,046 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-27 07:08:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,047 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-27 07:08:32,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-27 07:08:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:08:32,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:32,057 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,058 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-27 07:08:32,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83845624] [2019-12-27 07:08:32,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,161 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 07:08:32,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83845624] [2019-12-27 07:08:32,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:32,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820747376] [2019-12-27 07:08:32,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:32,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:32,163 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 3 states. [2019-12-27 07:08:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,223 INFO L93 Difference]: Finished difference Result 11575 states and 37288 transitions. [2019-12-27 07:08:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:32,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:08:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,250 INFO L225 Difference]: With dead ends: 11575 [2019-12-27 07:08:32,251 INFO L226 Difference]: Without dead ends: 11575 [2019-12-27 07:08:32,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11575 states. [2019-12-27 07:08:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11575 to 11443. [2019-12-27 07:08:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11443 states. [2019-12-27 07:08:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 36904 transitions. [2019-12-27 07:08:32,554 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 36904 transitions. Word has length 17 [2019-12-27 07:08:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,555 INFO L462 AbstractCegarLoop]: Abstraction has 11443 states and 36904 transitions. [2019-12-27 07:08:32,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 36904 transitions. [2019-12-27 07:08:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 07:08:32,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:32,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2136099962, now seen corresponding path program 1 times [2019-12-27 07:08:32,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786606324] [2019-12-27 07:08:32,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,626 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 07:08:32,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786606324] [2019-12-27 07:08:32,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:32,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037604142] [2019-12-27 07:08:32,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:32,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:32,629 INFO L87 Difference]: Start difference. First operand 11443 states and 36904 transitions. Second operand 4 states. [2019-12-27 07:08:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,662 INFO L93 Difference]: Finished difference Result 2348 states and 6213 transitions. [2019-12-27 07:08:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:32,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 07:08:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,666 INFO L225 Difference]: With dead ends: 2348 [2019-12-27 07:08:32,667 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 07:08:32,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 07:08:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2019-12-27 07:08:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2019-12-27 07:08:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4015 transitions. [2019-12-27 07:08:32,695 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4015 transitions. Word has length 18 [2019-12-27 07:08:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,696 INFO L462 AbstractCegarLoop]: Abstraction has 1670 states and 4015 transitions. [2019-12-27 07:08:32,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4015 transitions. [2019-12-27 07:08:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:32,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,701 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 07:08:32,702 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-27 07:08:32,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639527630] [2019-12-27 07:08:32,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,770 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 07:08:32,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639527630] [2019-12-27 07:08:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:32,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15414938] [2019-12-27 07:08:32,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:32,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:32,773 INFO L87 Difference]: Start difference. First operand 1670 states and 4015 transitions. Second operand 3 states. [2019-12-27 07:08:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,823 INFO L93 Difference]: Finished difference Result 2134 states and 4852 transitions. [2019-12-27 07:08:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:32,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 07:08:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,827 INFO L225 Difference]: With dead ends: 2134 [2019-12-27 07:08:32,827 INFO L226 Difference]: Without dead ends: 2134 [2019-12-27 07:08:32,827 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 07:08:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2019-12-27 07:08:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1555. [2019-12-27 07:08:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-12-27 07:08:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 3503 transitions. [2019-12-27 07:08:32,855 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 3503 transitions. Word has length 26 [2019-12-27 07:08:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,855 INFO L462 AbstractCegarLoop]: Abstraction has 1555 states and 3503 transitions. [2019-12-27 07:08:32,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 3503 transitions. [2019-12-27 07:08:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:32,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,858 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 07:08:32,858 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,859 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-27 07:08:32,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307035826] [2019-12-27 07:08:32,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,946 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 07:08:32,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307035826] [2019-12-27 07:08:32,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:32,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018276453] [2019-12-27 07:08:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:32,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:32,948 INFO L87 Difference]: Start difference. First operand 1555 states and 3503 transitions. Second operand 5 states. [2019-12-27 07:08:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:33,135 INFO L93 Difference]: Finished difference Result 2150 states and 4849 transitions. [2019-12-27 07:08:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:33,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:08:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:33,141 INFO L225 Difference]: With dead ends: 2150 [2019-12-27 07:08:33,141 INFO L226 Difference]: Without dead ends: 2148 [2019-12-27 07:08:33,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-12-27 07:08:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1647. [2019-12-27 07:08:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-27 07:08:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3725 transitions. [2019-12-27 07:08:33,215 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3725 transitions. Word has length 26 [2019-12-27 07:08:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:33,216 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3725 transitions. [2019-12-27 07:08:33,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3725 transitions. [2019-12-27 07:08:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:33,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:33,219 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] [2019-12-27 07:08:33,219 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-27 07:08:33,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:33,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484394563] [2019-12-27 07:08:33,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:33,289 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 07:08:33,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484394563] [2019-12-27 07:08:33,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:33,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:33,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148798835] [2019-12-27 07:08:33,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:33,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:33,291 INFO L87 Difference]: Start difference. First operand 1647 states and 3725 transitions. Second operand 5 states. [2019-12-27 07:08:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:33,530 INFO L93 Difference]: Finished difference Result 2085 states and 4728 transitions. [2019-12-27 07:08:33,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:33,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:33,534 INFO L225 Difference]: With dead ends: 2085 [2019-12-27 07:08:33,534 INFO L226 Difference]: Without dead ends: 2083 [2019-12-27 07:08:33,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-12-27 07:08:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1574. [2019-12-27 07:08:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-12-27 07:08:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 3550 transitions. [2019-12-27 07:08:33,565 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 3550 transitions. Word has length 27 [2019-12-27 07:08:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:33,565 INFO L462 AbstractCegarLoop]: Abstraction has 1574 states and 3550 transitions. [2019-12-27 07:08:33,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 3550 transitions. [2019-12-27 07:08:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:33,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:33,569 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] [2019-12-27 07:08:33,569 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-27 07:08:33,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:33,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7575462] [2019-12-27 07:08:33,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:33,663 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 07:08:33,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7575462] [2019-12-27 07:08:33,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:33,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:08:33,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123496165] [2019-12-27 07:08:33,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:33,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:33,665 INFO L87 Difference]: Start difference. First operand 1574 states and 3550 transitions. Second operand 5 states. [2019-12-27 07:08:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:33,709 INFO L93 Difference]: Finished difference Result 781 states and 1674 transitions. [2019-12-27 07:08:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:33,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:33,711 INFO L225 Difference]: With dead ends: 781 [2019-12-27 07:08:33,711 INFO L226 Difference]: Without dead ends: 707 [2019-12-27 07:08:33,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-27 07:08:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-12-27 07:08:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-27 07:08:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1503 transitions. [2019-12-27 07:08:33,723 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1503 transitions. Word has length 27 [2019-12-27 07:08:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:33,723 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1503 transitions. [2019-12-27 07:08:33,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1503 transitions. [2019-12-27 07:08:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:33,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:33,725 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 07:08:33,726 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:33,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:33,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1133197983, now seen corresponding path program 1 times [2019-12-27 07:08:33,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:33,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710883649] [2019-12-27 07:08:33,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:33,786 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 07:08:33,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710883649] [2019-12-27 07:08:33,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:33,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:33,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103258730] [2019-12-27 07:08:33,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:33,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:33,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:33,790 INFO L87 Difference]: Start difference. First operand 707 states and 1503 transitions. Second operand 4 states. [2019-12-27 07:08:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:33,808 INFO L93 Difference]: Finished difference Result 1173 states and 2520 transitions. [2019-12-27 07:08:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:33,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 07:08:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:33,811 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 07:08:33,811 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 07:08:33,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 07:08:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-27 07:08:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-27 07:08:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1050 transitions. [2019-12-27 07:08:33,822 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1050 transitions. Word has length 42 [2019-12-27 07:08:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:33,822 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1050 transitions. [2019-12-27 07:08:33,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1050 transitions. [2019-12-27 07:08:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:33,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:33,824 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 07:08:33,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913551, now seen corresponding path program 2 times [2019-12-27 07:08:33,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:33,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931411241] [2019-12-27 07:08:33,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:33,928 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 07:08:33,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931411241] [2019-12-27 07:08:33,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:33,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:33,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240130462] [2019-12-27 07:08:33,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:08:33,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:33,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:08:33,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:33,931 INFO L87 Difference]: Start difference. First operand 486 states and 1050 transitions. Second operand 7 states. [2019-12-27 07:08:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:34,107 INFO L93 Difference]: Finished difference Result 887 states and 1866 transitions. [2019-12-27 07:08:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:08:34,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 07:08:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:34,110 INFO L225 Difference]: With dead ends: 887 [2019-12-27 07:08:34,110 INFO L226 Difference]: Without dead ends: 593 [2019-12-27 07:08:34,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:08:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-27 07:08:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 527. [2019-12-27 07:08:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-27 07:08:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1106 transitions. [2019-12-27 07:08:34,120 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1106 transitions. Word has length 42 [2019-12-27 07:08:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:34,121 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1106 transitions. [2019-12-27 07:08:34,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:08:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1106 transitions. [2019-12-27 07:08:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:34,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:34,123 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 07:08:34,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 3 times [2019-12-27 07:08:34,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:34,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793265918] [2019-12-27 07:08:34,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:34,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:08:34,280 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:08:34,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19|)) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1651~0.base_19| 1)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$flush_delayed~0_13) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0))) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd1~0_65 0) (= |v_ULTIMATE.start_main_~#t1651~0.offset_17| 0) (= 0 v_~y$r_buff1_thd2~0_17) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1651~0.base_19|) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1651~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_~#t1651~0.base=|v_ULTIMATE.start_main_~#t1651~0.base_19|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1651~0.offset=|v_ULTIMATE.start_main_~#t1651~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1651~0.base, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1652~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1652~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1651~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:08:34,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9| 1)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1652~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1652~0.offset_8| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1652~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1652~0.base_9|) |v_ULTIMATE.start_main_~#t1652~0.offset_8| 1))) (not (= |v_ULTIMATE.start_main_~#t1652~0.base_9| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1652~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1652~0.base=|v_ULTIMATE.start_main_~#t1652~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1652~0.offset=|v_ULTIMATE.start_main_~#t1652~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1652~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1652~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 07:08:34,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:08:34,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-961753266 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-961753266 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-961753266| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-961753266| ~y$w_buff0_used~0_In-961753266) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-961753266, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-961753266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-961753266, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-961753266, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-961753266|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:08:34,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-873849849 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-873849849 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-873849849 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-873849849 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-873849849|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-873849849| ~y$w_buff1_used~0_In-873849849) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-873849849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-873849849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-873849849, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-873849849} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-873849849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-873849849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-873849849, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-873849849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-873849849} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:08:34,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1702864789 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1702864789 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1702864789 ~y$r_buff0_thd2~0_Out1702864789)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1702864789)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1702864789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1702864789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1702864789, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1702864789|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1702864789} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:08:34,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-307206077 256) 0))) (or (and (= ~y$w_buff1_used~0_In-307206077 |P0Thread1of1ForFork1_#t~ite17_Out-307206077|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-307206077 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-307206077 256)) (and (= (mod ~y$r_buff1_thd1~0_In-307206077 256) 0) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-307206077 256) 0)))) (= |P0Thread1of1ForFork1_#t~ite17_Out-307206077| |P0Thread1of1ForFork1_#t~ite18_Out-307206077|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite17_In-307206077| |P0Thread1of1ForFork1_#t~ite17_Out-307206077|) (= ~y$w_buff1_used~0_In-307206077 |P0Thread1of1ForFork1_#t~ite18_Out-307206077|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-307206077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-307206077, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-307206077, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-307206077|, ~weak$$choice2~0=~weak$$choice2~0_In-307206077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-307206077} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-307206077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-307206077, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-307206077, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-307206077|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-307206077|, ~weak$$choice2~0=~weak$$choice2~0_In-307206077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-307206077} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:08:34,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:08:34,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 07:08:34,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In845315625 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In845315625 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In845315625 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In845315625 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out845315625| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out845315625| ~y$r_buff1_thd2~0_In845315625) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845315625, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845315625, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845315625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845315625} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845315625, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845315625, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out845315625|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845315625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845315625} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:08:34,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |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{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__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[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:08:34,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:08:34,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In390170318 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In390170318 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In390170318 |ULTIMATE.start_main_#t~ite34_Out390170318|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out390170318| ~y$w_buff1~0_In390170318)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In390170318, ~y~0=~y~0_In390170318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In390170318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In390170318} OutVars{~y$w_buff1~0=~y$w_buff1~0_In390170318, ~y~0=~y~0_In390170318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In390170318, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out390170318|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In390170318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:34,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~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|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:34,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1582405638 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1582405638 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1582405638|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1582405638 |ULTIMATE.start_main_#t~ite36_Out1582405638|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1582405638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1582405638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1582405638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1582405638, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1582405638|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 07:08:34,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In390219066 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In390219066 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In390219066 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In390219066 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In390219066 |ULTIMATE.start_main_#t~ite37_Out390219066|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out390219066|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In390219066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In390219066, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In390219066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In390219066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In390219066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In390219066, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out390219066|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In390219066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In390219066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:08:34,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1716176064 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1716176064 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1716176064| ~y$r_buff0_thd0~0_In1716176064) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1716176064|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1716176064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1716176064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1716176064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1716176064, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1716176064|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:08:34,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1627168602 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1627168602 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1627168602 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1627168602 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1627168602| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite39_Out1627168602| ~y$r_buff1_thd0~0_In1627168602) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1627168602, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1627168602, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1627168602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1627168602} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1627168602, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1627168602|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1627168602, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1627168602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1627168602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 07:08:34,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-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) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} 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_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, 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, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:08:34,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:34 BasicIcfg [2019-12-27 07:08:34,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:08:34,401 INFO L168 Benchmark]: Toolchain (without parser) took 14582.98 ms. Allocated memory was 144.7 MB in the beginning and 709.9 MB in the end (delta: 565.2 MB). Free memory was 101.3 MB in the beginning and 387.3 MB in the end (delta: -286.0 MB). Peak memory consumption was 279.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,401 INFO L168 Benchmark]: CDTParser took 1.64 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.05 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 154.7 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,403 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,404 INFO L168 Benchmark]: Boogie Preprocessor took 37.68 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,404 INFO L168 Benchmark]: RCFGBuilder took 795.51 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 108.9 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,405 INFO L168 Benchmark]: TraceAbstraction took 12824.35 ms. Allocated memory was 202.4 MB in the beginning and 709.9 MB in the end (delta: 507.5 MB). Free memory was 108.2 MB in the beginning and 387.3 MB in the end (delta: -279.1 MB). Peak memory consumption was 228.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:34,409 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.64 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.05 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 154.7 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 152.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.68 ms. Allocated memory is still 202.4 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.51 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 108.9 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12824.35 ms. Allocated memory was 202.4 MB in the beginning and 709.9 MB in the end (delta: 507.5 MB). Free memory was 108.2 MB in the beginning and 387.3 MB in the end (delta: -279.1 MB). Peak memory consumption was 228.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1651, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1652, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1455 SDtfs, 1349 SDslu, 2147 SDs, 0 SdLazy, 889 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 6871 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 20852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...