/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:24:05,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:24:05,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:24:05,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:24:05,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:24:05,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:24:05,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:24:05,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:24:05,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:24:05,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:24:05,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:24:05,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:24:05,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:24:05,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:24:05,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:24:05,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:24:05,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:24:05,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:24:05,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:24:05,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:24:05,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:24:05,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:24:05,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:24:05,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:24:05,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:24:05,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:24:05,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:24:05,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:24:05,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:24:05,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:24:05,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:24:05,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:24:05,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:24:05,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:24:05,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:24:05,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:24:05,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:24:05,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:24:05,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:24:05,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:24:05,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:24:05,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:24:05,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:24:05,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:24:05,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:24:05,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:24:05,631 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:24:05,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:24:05,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:24:05,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:24:05,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:24:05,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:24:05,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:24:05,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:24:05,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:24:05,633 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:24:05,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:24:05,634 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:24:05,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:24:05,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:24:05,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:24:05,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:24:05,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:24:05,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:24:05,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:24:05,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:24:05,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:24:05,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:24:05,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:24:05,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:24:05,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:24:05,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:24:05,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:24:05,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:24:05,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:24:05,950 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:24:05,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-18 18:24:06,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cd7f1f3/aca81cec58d549ee86b98277572c6d40/FLAGc67a58dd7 [2019-12-18 18:24:06,604 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:24:06,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-18 18:24:06,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cd7f1f3/aca81cec58d549ee86b98277572c6d40/FLAGc67a58dd7 [2019-12-18 18:24:06,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cd7f1f3/aca81cec58d549ee86b98277572c6d40 [2019-12-18 18:24:06,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:24:06,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:24:06,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:24:06,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:24:06,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:24:06,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:24:06" (1/1) ... [2019-12-18 18:24:06,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695d6cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:06, skipping insertion in model container [2019-12-18 18:24:06,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:24:06" (1/1) ... [2019-12-18 18:24:06,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:24:06,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:24:07,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:24:07,468 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:24:07,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:24:07,643 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:24:07,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07 WrapperNode [2019-12-18 18:24:07,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:24:07,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:24:07,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:24:07,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:24:07,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:24:07,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:24:07,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:24:07,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:24:07,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (1/1) ... [2019-12-18 18:24:07,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:24:07,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:24:07,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:24:07,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:24:07,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (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-18 18:24:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:24:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:24:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:24:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:24:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:24:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:24:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:24:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:24:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:24:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:24:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:24:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:24:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:24:07,847 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:24:08,630 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:24:08,630 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:24:08,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:24:08 BoogieIcfgContainer [2019-12-18 18:24:08,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:24:08,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:24:08,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:24:08,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:24:08,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:24:06" (1/3) ... [2019-12-18 18:24:08,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb10f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:24:08, skipping insertion in model container [2019-12-18 18:24:08,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:24:07" (2/3) ... [2019-12-18 18:24:08,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb10f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:24:08, skipping insertion in model container [2019-12-18 18:24:08,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:24:08" (3/3) ... [2019-12-18 18:24:08,641 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_power.opt.i [2019-12-18 18:24:08,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:24:08,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:24:08,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:24:08,662 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:24:08,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,720 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,721 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,769 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,770 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:24:08,786 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:24:08,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:24:08,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:24:08,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:24:08,806 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:24:08,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:24:08,806 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:24:08,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:24:08,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:24:08,824 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 18:24:08,827 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:24:08,916 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:24:08,916 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:24:08,937 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:24:08,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:24:09,011 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:24:09,012 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:24:09,021 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:24:09,045 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 18:24:09,046 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:24:13,897 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 18:24:14,253 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 18:24:14,380 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 18:24:14,409 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-18 18:24:14,409 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 18:24:14,413 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 18:24:30,007 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 18:24:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 18:24:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:24:30,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:24:30,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:24:30,016 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:24:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:24:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-18 18:24:30,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:24:30,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233154848] [2019-12-18 18:24:30,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:24:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:24:30,305 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-18 18:24:30,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233154848] [2019-12-18 18:24:30,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:24:30,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:24:30,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211175044] [2019-12-18 18:24:30,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:24:30,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:24:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:24:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:24:30,337 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 18:24:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:24:32,819 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 18:24:32,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:24:32,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:24:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:24:33,480 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 18:24:33,481 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 18:24:33,482 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-18 18:24:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 18:24:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 18:24:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 18:24:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 18:24:44,012 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 18:24:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:24:44,013 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 18:24:44,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:24:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 18:24:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:24:44,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:24:44,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:24:44,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:24:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:24:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-18 18:24:44,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:24:44,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43828729] [2019-12-18 18:24:44,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:24:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:24:44,146 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-18 18:24:44,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43828729] [2019-12-18 18:24:44,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:24:44,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:24:44,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202630525] [2019-12-18 18:24:44,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:24:44,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:24:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:24:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:24:44,150 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 18:24:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:24:49,137 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 18:24:49,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:24:49,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:24:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:24:50,302 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 18:24:50,302 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 18:24:50,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:24:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 18:24:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 18:24:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 18:24:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 18:24:59,160 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 18:24:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:24:59,161 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 18:24:59,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:24:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 18:24:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:24:59,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:24:59,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:24:59,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:24:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:24:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-18 18:24:59,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:24:59,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993791521] [2019-12-18 18:24:59,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:24:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:25:05,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993791521] [2019-12-18 18:25:05,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:05,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:25:05,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336455435] [2019-12-18 18:25:05,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:25:05,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:25:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:25:05,067 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 18:25:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:07,296 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 18:25:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:25:07,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:25:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:07,950 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 18:25:07,950 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 18:25:07,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:25:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 18:25:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 18:25:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 18:25:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 18:25:22,958 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 18:25:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:22,960 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 18:25:22,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:25:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 18:25:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:25:22,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:22,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:22,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-18 18:25:22,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:22,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961407448] [2019-12-18 18:25:22,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:25:23,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961407448] [2019-12-18 18:25:23,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:23,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:25:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763126852] [2019-12-18 18:25:23,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:25:23,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:25:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:23,020 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 18:25:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:23,225 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 18:25:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:25:23,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:25:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:23,304 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 18:25:23,304 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 18:25:23,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 18:25:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 18:25:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 18:25:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 18:25:28,944 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 18:25:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:28,945 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 18:25:28,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:25:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 18:25:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:25:28,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:28,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:28,948 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-18 18:25:28,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:28,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575654766] [2019-12-18 18:25:28,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:25:29,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575654766] [2019-12-18 18:25:29,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:29,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:25:29,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508687471] [2019-12-18 18:25:29,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:25:29,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:25:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:25:29,088 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 18:25:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:29,901 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 18:25:29,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:25:29,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:25:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:29,981 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 18:25:29,981 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 18:25:29,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:25:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 18:25:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 18:25:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 18:25:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 18:25:30,998 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 18:25:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:30,998 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 18:25:30,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:25:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 18:25:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:25:31,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:31,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:31,010 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:31,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-18 18:25:31,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:31,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611273170] [2019-12-18 18:25:31,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:31,065 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-18 18:25:31,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611273170] [2019-12-18 18:25:31,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:31,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:25:31,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986251882] [2019-12-18 18:25:31,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:25:31,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:31,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:25:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:25:31,068 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 18:25:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:31,107 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 18:25:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:25:31,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:25:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:31,117 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 18:25:31,118 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 18:25:31,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:25:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 18:25:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 18:25:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 18:25:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 18:25:31,215 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 18:25:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:31,216 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 18:25:31,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:25:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 18:25:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:25:31,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:31,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:31,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-18 18:25:31,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:31,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893389068] [2019-12-18 18:25:31,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:31,323 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-18 18:25:31,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893389068] [2019-12-18 18:25:31,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:31,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:25:31,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926889982] [2019-12-18 18:25:31,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:25:31,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:25:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:25:31,326 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 18:25:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:31,366 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 18:25:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:25:31,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:25:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:31,374 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 18:25:31,374 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 18:25:31,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:25:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 18:25:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 18:25:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 18:25:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 18:25:31,442 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 18:25:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:31,443 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 18:25:31,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:25:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 18:25:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:25:31,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:31,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:31,452 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-18 18:25:31,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:31,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682232773] [2019-12-18 18:25:31,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:31,518 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-18 18:25:31,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682232773] [2019-12-18 18:25:31,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:31,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:25:31,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090592518] [2019-12-18 18:25:31,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:25:31,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:25:31,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:31,520 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 18:25:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:31,577 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 18:25:31,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:25:31,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:25:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:31,585 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 18:25:31,585 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 18:25:31,586 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-18 18:25:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 18:25:31,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 18:25:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 18:25:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 18:25:31,680 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 18:25:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:31,681 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 18:25:31,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:25:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 18:25:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:25:31,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:31,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:31,691 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-18 18:25:31,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:31,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472476562] [2019-12-18 18:25:31,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:31,776 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-18 18:25:31,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472476562] [2019-12-18 18:25:31,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:31,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:25:31,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458740399] [2019-12-18 18:25:31,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:25:31,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:25:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:31,778 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 18:25:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:31,839 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 18:25:31,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:25:31,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:25:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:31,846 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 18:25:31,847 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 18:25:31,847 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-18 18:25:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 18:25:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 18:25:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 18:25:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 18:25:31,932 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 18:25:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:31,933 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 18:25:31,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:25:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 18:25:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:25:31,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:31,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:31,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-18 18:25:31,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:31,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251962243] [2019-12-18 18:25:31,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:32,074 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-18 18:25:32,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251962243] [2019-12-18 18:25:32,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:32,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:25:32,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181638581] [2019-12-18 18:25:32,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:25:32,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:32,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:25:32,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:25:32,077 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-18 18:25:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:32,639 INFO L93 Difference]: Finished difference Result 8765 states and 25085 transitions. [2019-12-18 18:25:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:25:32,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 18:25:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:32,652 INFO L225 Difference]: With dead ends: 8765 [2019-12-18 18:25:32,653 INFO L226 Difference]: Without dead ends: 8765 [2019-12-18 18:25:32,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:25:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-12-18 18:25:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 5421. [2019-12-18 18:25:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-18 18:25:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-18 18:25:32,745 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-18 18:25:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:32,746 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-18 18:25:32,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:25:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-18 18:25:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:25:32,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:32,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:32,753 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash -191494421, now seen corresponding path program 2 times [2019-12-18 18:25:32,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:32,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116866663] [2019-12-18 18:25:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:32,850 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-18 18:25:32,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116866663] [2019-12-18 18:25:32,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:32,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:25:32,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41398624] [2019-12-18 18:25:32,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:25:32,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:25:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:25:32,853 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 5 states. [2019-12-18 18:25:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:33,183 INFO L93 Difference]: Finished difference Result 7981 states and 22730 transitions. [2019-12-18 18:25:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:25:33,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:25:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:33,195 INFO L225 Difference]: With dead ends: 7981 [2019-12-18 18:25:33,195 INFO L226 Difference]: Without dead ends: 7981 [2019-12-18 18:25:33,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:25:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7981 states. [2019-12-18 18:25:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7981 to 5923. [2019-12-18 18:25:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-18 18:25:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-18 18:25:33,465 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-18 18:25:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-18 18:25:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:25:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-18 18:25:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:25:33,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:33,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:33,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash 147719209, now seen corresponding path program 3 times [2019-12-18 18:25:33,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:33,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273462939] [2019-12-18 18:25:33,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:33,533 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-18 18:25:33,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273462939] [2019-12-18 18:25:33,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:33,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:25:33,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988376572] [2019-12-18 18:25:33,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:25:33,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:25:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:33,535 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-18 18:25:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:33,565 INFO L93 Difference]: Finished difference Result 5119 states and 14578 transitions. [2019-12-18 18:25:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:25:33,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:25:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:33,573 INFO L225 Difference]: With dead ends: 5119 [2019-12-18 18:25:33,573 INFO L226 Difference]: Without dead ends: 5119 [2019-12-18 18:25:33,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-18 18:25:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4839. [2019-12-18 18:25:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-18 18:25:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13806 transitions. [2019-12-18 18:25:33,676 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13806 transitions. Word has length 65 [2019-12-18 18:25:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:33,677 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13806 transitions. [2019-12-18 18:25:33,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:25:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13806 transitions. [2019-12-18 18:25:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:25:33,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:33,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:33,688 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:33,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2002555555, now seen corresponding path program 1 times [2019-12-18 18:25:33,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:33,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336890712] [2019-12-18 18:25:33,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:33,803 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-18 18:25:33,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336890712] [2019-12-18 18:25:33,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:33,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:25:33,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454514142] [2019-12-18 18:25:33,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:25:33,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:25:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:25:33,808 INFO L87 Difference]: Start difference. First operand 4839 states and 13806 transitions. Second operand 6 states. [2019-12-18 18:25:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:34,223 INFO L93 Difference]: Finished difference Result 7011 states and 19683 transitions. [2019-12-18 18:25:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:25:34,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 18:25:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:34,234 INFO L225 Difference]: With dead ends: 7011 [2019-12-18 18:25:34,234 INFO L226 Difference]: Without dead ends: 7011 [2019-12-18 18:25:34,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:25:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2019-12-18 18:25:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 5532. [2019-12-18 18:25:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-12-18 18:25:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 15751 transitions. [2019-12-18 18:25:34,321 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 15751 transitions. Word has length 66 [2019-12-18 18:25:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:34,322 INFO L462 AbstractCegarLoop]: Abstraction has 5532 states and 15751 transitions. [2019-12-18 18:25:34,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:25:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 15751 transitions. [2019-12-18 18:25:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:25:34,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:34,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:34,330 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2081518173, now seen corresponding path program 2 times [2019-12-18 18:25:34,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:34,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356734833] [2019-12-18 18:25:34,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:34,420 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-18 18:25:34,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356734833] [2019-12-18 18:25:34,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:34,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:25:34,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050565335] [2019-12-18 18:25:34,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:25:34,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:34,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:25:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:25:34,423 INFO L87 Difference]: Start difference. First operand 5532 states and 15751 transitions. Second operand 6 states. [2019-12-18 18:25:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:34,886 INFO L93 Difference]: Finished difference Result 7597 states and 21220 transitions. [2019-12-18 18:25:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:25:34,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 18:25:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:34,897 INFO L225 Difference]: With dead ends: 7597 [2019-12-18 18:25:34,897 INFO L226 Difference]: Without dead ends: 7597 [2019-12-18 18:25:34,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:25:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2019-12-18 18:25:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 5931. [2019-12-18 18:25:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-18 18:25:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 16730 transitions. [2019-12-18 18:25:34,996 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 16730 transitions. Word has length 66 [2019-12-18 18:25:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:34,996 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 16730 transitions. [2019-12-18 18:25:34,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:25:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 16730 transitions. [2019-12-18 18:25:35,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:25:35,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:35,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:35,004 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1769494633, now seen corresponding path program 3 times [2019-12-18 18:25:35,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:35,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305620196] [2019-12-18 18:25:35,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:35,068 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-18 18:25:35,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305620196] [2019-12-18 18:25:35,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:35,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:25:35,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137109716] [2019-12-18 18:25:35,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:25:35,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:35,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:25:35,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:35,070 INFO L87 Difference]: Start difference. First operand 5931 states and 16730 transitions. Second operand 3 states. [2019-12-18 18:25:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:35,122 INFO L93 Difference]: Finished difference Result 5931 states and 16729 transitions. [2019-12-18 18:25:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:25:35,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:25:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:35,131 INFO L225 Difference]: With dead ends: 5931 [2019-12-18 18:25:35,131 INFO L226 Difference]: Without dead ends: 5931 [2019-12-18 18:25:35,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-12-18 18:25:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 3666. [2019-12-18 18:25:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2019-12-18 18:25:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 10476 transitions. [2019-12-18 18:25:35,217 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 10476 transitions. Word has length 66 [2019-12-18 18:25:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:35,217 INFO L462 AbstractCegarLoop]: Abstraction has 3666 states and 10476 transitions. [2019-12-18 18:25:35,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:25:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 10476 transitions. [2019-12-18 18:25:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:25:35,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:35,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:35,224 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2088426852, now seen corresponding path program 1 times [2019-12-18 18:25:35,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:35,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61880607] [2019-12-18 18:25:35,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:35,386 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-18 18:25:35,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61880607] [2019-12-18 18:25:35,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:35,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:25:35,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331301405] [2019-12-18 18:25:35,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:25:35,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:25:35,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:25:35,392 INFO L87 Difference]: Start difference. First operand 3666 states and 10476 transitions. Second operand 7 states. [2019-12-18 18:25:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:35,631 INFO L93 Difference]: Finished difference Result 12210 states and 35217 transitions. [2019-12-18 18:25:35,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:25:35,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 18:25:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:35,643 INFO L225 Difference]: With dead ends: 12210 [2019-12-18 18:25:35,643 INFO L226 Difference]: Without dead ends: 7231 [2019-12-18 18:25:35,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:25:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7231 states. [2019-12-18 18:25:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7231 to 3666. [2019-12-18 18:25:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2019-12-18 18:25:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 10397 transitions. [2019-12-18 18:25:35,741 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 10397 transitions. Word has length 67 [2019-12-18 18:25:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:35,742 INFO L462 AbstractCegarLoop]: Abstraction has 3666 states and 10397 transitions. [2019-12-18 18:25:35,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:25:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 10397 transitions. [2019-12-18 18:25:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:25:35,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:35,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:35,753 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash -136921254, now seen corresponding path program 2 times [2019-12-18 18:25:35,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:35,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641281362] [2019-12-18 18:25:35,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:35,819 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-18 18:25:35,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641281362] [2019-12-18 18:25:35,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:35,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:25:35,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223594290] [2019-12-18 18:25:35,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:25:35,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:25:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:35,822 INFO L87 Difference]: Start difference. First operand 3666 states and 10397 transitions. Second operand 3 states. [2019-12-18 18:25:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:35,845 INFO L93 Difference]: Finished difference Result 3476 states and 9679 transitions. [2019-12-18 18:25:35,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:25:35,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 18:25:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:35,849 INFO L225 Difference]: With dead ends: 3476 [2019-12-18 18:25:35,850 INFO L226 Difference]: Without dead ends: 3476 [2019-12-18 18:25:35,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:25:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2019-12-18 18:25:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3262. [2019-12-18 18:25:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-12-18 18:25:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 9081 transitions. [2019-12-18 18:25:35,906 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 9081 transitions. Word has length 67 [2019-12-18 18:25:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:35,907 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 9081 transitions. [2019-12-18 18:25:35,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:25:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 9081 transitions. [2019-12-18 18:25:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:25:35,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:35,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:35,910 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash 942277324, now seen corresponding path program 1 times [2019-12-18 18:25:35,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:35,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002282954] [2019-12-18 18:25:35,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:35,993 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-18 18:25:35,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002282954] [2019-12-18 18:25:35,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:35,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:25:35,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446658998] [2019-12-18 18:25:35,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:25:35,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:25:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:25:35,995 INFO L87 Difference]: Start difference. First operand 3262 states and 9081 transitions. Second operand 5 states. [2019-12-18 18:25:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:36,050 INFO L93 Difference]: Finished difference Result 5003 states and 13916 transitions. [2019-12-18 18:25:36,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:25:36,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-18 18:25:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:36,054 INFO L225 Difference]: With dead ends: 5003 [2019-12-18 18:25:36,054 INFO L226 Difference]: Without dead ends: 1963 [2019-12-18 18:25:36,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:25:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-12-18 18:25:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2019-12-18 18:25:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-18 18:25:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 5391 transitions. [2019-12-18 18:25:36,089 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 5391 transitions. Word has length 68 [2019-12-18 18:25:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:36,089 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 5391 transitions. [2019-12-18 18:25:36,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:25:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 5391 transitions. [2019-12-18 18:25:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:25:36,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:36,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:36,092 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:36,092 INFO L82 PathProgramCache]: Analyzing trace with hash -213601006, now seen corresponding path program 2 times [2019-12-18 18:25:36,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:36,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004908400] [2019-12-18 18:25:36,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:25:36,183 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-18 18:25:36,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004908400] [2019-12-18 18:25:36,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:25:36,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:25:36,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452884421] [2019-12-18 18:25:36,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:25:36,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:25:36,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:25:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:25:36,186 INFO L87 Difference]: Start difference. First operand 1963 states and 5391 transitions. Second operand 6 states. [2019-12-18 18:25:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:25:36,248 INFO L93 Difference]: Finished difference Result 3693 states and 10196 transitions. [2019-12-18 18:25:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:25:36,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 18:25:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:25:36,251 INFO L225 Difference]: With dead ends: 3693 [2019-12-18 18:25:36,251 INFO L226 Difference]: Without dead ends: 1771 [2019-12-18 18:25:36,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:25:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2019-12-18 18:25:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2019-12-18 18:25:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-12-18 18:25:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 4877 transitions. [2019-12-18 18:25:36,277 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 4877 transitions. Word has length 68 [2019-12-18 18:25:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:25:36,277 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 4877 transitions. [2019-12-18 18:25:36,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:25:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 4877 transitions. [2019-12-18 18:25:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:25:36,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:25:36,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:25:36,279 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:25:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:25:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 3 times [2019-12-18 18:25:36,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:25:36,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929879098] [2019-12-18 18:25:36,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:25:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:25:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:25:36,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:25:36,419 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:25:36,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20|)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1876~0.base_20| 4) |v_#length_25|) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (= |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1876~0.base_20|) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20|) |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20| 1)) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1876~0.offset=|v_ULTIMATE.start_main_~#t1876~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_~#t1876~0.base=|v_ULTIMATE.start_main_~#t1876~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_20|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1878~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1876~0.offset, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1877~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t1876~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1878~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:25:36,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1877~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1877~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1877~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11|) |v_ULTIMATE.start_main_~#t1877~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1877~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_11|, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_~#t1877~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 18:25:36,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1878~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t1878~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1878~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9|) |v_ULTIMATE.start_main_~#t1878~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1878~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1878~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1878~0.base] because there is no mapped edge [2019-12-18 18:25:36,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:25:36,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1432948810 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1432948810 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1432948810| ~x$w_buff1~0_In1432948810)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1432948810| ~x~0_In1432948810) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1432948810, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1432948810, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1432948810, ~x~0=~x~0_In1432948810} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1432948810|, ~x$w_buff1~0=~x$w_buff1~0_In1432948810, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1432948810, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1432948810, ~x~0=~x~0_In1432948810} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:25:36,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 18:25:36,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In507118925 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In507118925 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out507118925| ~x$w_buff0_used~0_In507118925) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out507118925| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In507118925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507118925} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In507118925, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out507118925|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In507118925} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:25:36,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2133427114 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In2133427114 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2133427114 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In2133427114 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out2133427114| ~x$w_buff1_used~0_In2133427114) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out2133427114| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2133427114, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2133427114, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2133427114, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133427114} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2133427114, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2133427114, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2133427114, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2133427114|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133427114} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:25:36,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1454219367| |P0Thread1of1ForFork0_#t~ite3_Out-1454219367|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1454219367 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1454219367 256)))) (or (and .cse0 (= ~x$w_buff1~0_In-1454219367 |P0Thread1of1ForFork0_#t~ite3_Out-1454219367|) (not .cse1) (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1454219367| ~x~0_In-1454219367) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1454219367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1454219367, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1454219367, ~x~0=~x~0_In-1454219367} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1454219367|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1454219367|, ~x$w_buff1~0=~x$w_buff1~0_In-1454219367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1454219367, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1454219367, ~x~0=~x~0_In-1454219367} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 18:25:36,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In64927536 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In64927536 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out64927536| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out64927536| ~x$w_buff0_used~0_In64927536) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In64927536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64927536} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out64927536|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In64927536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64927536} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:25:36,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1768807434 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1768807434 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1768807434 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1768807434 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1768807434| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1768807434| ~x$w_buff1_used~0_In-1768807434) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1768807434, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1768807434, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1768807434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1768807434} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1768807434|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1768807434, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1768807434, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1768807434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1768807434} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:25:36,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2027563519 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2027563519 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out2027563519| ~x$r_buff0_thd3~0_In2027563519)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out2027563519|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2027563519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027563519} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2027563519, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2027563519|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027563519} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:25:36,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1802772549 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1802772549 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1802772549 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1802772549 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1802772549| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out1802772549| ~x$r_buff1_thd3~0_In1802772549)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1802772549, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1802772549, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1802772549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1802772549} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1802772549|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1802772549, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1802772549, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1802772549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1802772549} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:25:36,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:25:36,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-466456095 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-466456095 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-466456095 |P0Thread1of1ForFork0_#t~ite7_Out-466456095|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-466456095| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-466456095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-466456095} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-466456095, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-466456095|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-466456095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:25:36,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1161555095 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1161555095 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1161555095 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1161555095 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1161555095| ~x$r_buff1_thd1~0_In-1161555095) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1161555095| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1161555095, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1161555095, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1161555095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161555095} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1161555095, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1161555095|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1161555095, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1161555095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1161555095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:25:36,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:25:36,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2142170417 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2142170417 256)))) (or (and (= ~x$w_buff0_used~0_In2142170417 |P1Thread1of1ForFork1_#t~ite11_Out2142170417|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out2142170417| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2142170417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2142170417} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2142170417|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2142170417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2142170417} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:25:36,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1168374456 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1168374456 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1168374456 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1168374456 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1168374456|)) (and (= ~x$w_buff1_used~0_In1168374456 |P1Thread1of1ForFork1_#t~ite12_Out1168374456|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1168374456, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1168374456, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1168374456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1168374456} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1168374456, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1168374456, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1168374456|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1168374456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1168374456} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:25:36,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1414514587 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1414514587 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1414514587 ~x$r_buff0_thd2~0_In-1414514587)) (and (= ~x$r_buff0_thd2~0_Out-1414514587 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1414514587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414514587} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1414514587|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1414514587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414514587} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:25:36,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1186895610 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1186895610 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1186895610 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1186895610 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1186895610|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out1186895610| ~x$r_buff1_thd2~0_In1186895610)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1186895610, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1186895610, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1186895610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1186895610} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1186895610, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1186895610, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1186895610, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1186895610|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1186895610} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:25:36,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:25:36,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:25:36,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-462724891 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-462724891| |ULTIMATE.start_main_#t~ite25_Out-462724891|)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-462724891 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-462724891| ~x~0_In-462724891) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-462724891| ~x$w_buff1~0_In-462724891) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-462724891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-462724891, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-462724891, ~x~0=~x~0_In-462724891} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-462724891, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-462724891|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-462724891|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-462724891, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-462724891, ~x~0=~x~0_In-462724891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 18:25:36,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-497873350 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-497873350 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out-497873350| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-497873350 |ULTIMATE.start_main_#t~ite26_Out-497873350|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-497873350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497873350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-497873350, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-497873350|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497873350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:25:36,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In390494190 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In390494190 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In390494190 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In390494190 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out390494190| ~x$w_buff1_used~0_In390494190) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out390494190| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In390494190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In390494190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In390494190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390494190} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In390494190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In390494190, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out390494190|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In390494190, ~x$w_buff0_used~0=~x$w_buff0_used~0_In390494190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:25:36,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-460143204 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-460143204 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-460143204| ~x$r_buff0_thd0~0_In-460143204)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-460143204| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-460143204, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-460143204} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-460143204, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-460143204|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-460143204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:25:36,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-2142526593 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2142526593 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2142526593 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2142526593 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-2142526593| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite29_Out-2142526593| ~x$r_buff1_thd0~0_In-2142526593)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2142526593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2142526593, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2142526593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2142526593} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2142526593, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2142526593|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2142526593, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2142526593, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2142526593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:25:36,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:25:36,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:25:36,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:25:36,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:25:36 BasicIcfg [2019-12-18 18:25:36,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:25:36,556 INFO L168 Benchmark]: Toolchain (without parser) took 89661.20 ms. Allocated memory was 144.7 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,557 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.92 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 155.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,559 INFO L168 Benchmark]: Boogie Preprocessor took 40.26 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,559 INFO L168 Benchmark]: RCFGBuilder took 874.39 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 99.8 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,560 INFO L168 Benchmark]: TraceAbstraction took 87921.79 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 18:25:36,564 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.92 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 155.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.26 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.39 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 99.8 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87921.79 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2793 SDtfs, 2083 SDslu, 4695 SDs, 0 SdLazy, 2457 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 78535 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 897 ConstructedInterpolants, 0 QuantifiedInterpolants, 129605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...