/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:17:38,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:17:38,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:17:38,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:17:38,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:17:38,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:17:38,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:17:38,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:17:38,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:17:38,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:17:38,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:17:38,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:17:38,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:17:38,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:17:38,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:17:38,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:17:38,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:17:38,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:17:38,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:17:38,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:17:38,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:17:38,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:17:38,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:17:38,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:17:38,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:17:38,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:17:38,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:17:38,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:17:38,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:17:38,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:17:38,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:17:38,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:17:38,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:17:38,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:17:38,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:17:38,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:17:38,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:17:38,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:17:38,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:17:38,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:17:38,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:17:38,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:17:38,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:17:38,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:17:38,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:17:38,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:17:38,754 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:17:38,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:17:38,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:17:38,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:17:38,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:17:38,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:17:38,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:17:38,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:17:38,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:17:38,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:17:38,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:17:38,757 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:17:38,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:17:38,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:17:38,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:17:38,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:17:38,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:17:38,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:17:38,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:17:38,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:17:38,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:17:38,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:17:38,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:17:38,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:17:38,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:17:38,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:17:39,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:17:39,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:17:39,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:17:39,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:17:39,050 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:17:39,052 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-18 13:17:39,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e984ecba1/65ae5cb936044d78822a79145e278f37/FLAGde0d1f9b4 [2019-12-18 13:17:39,642 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:17:39,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-18 13:17:39,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e984ecba1/65ae5cb936044d78822a79145e278f37/FLAGde0d1f9b4 [2019-12-18 13:17:39,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e984ecba1/65ae5cb936044d78822a79145e278f37 [2019-12-18 13:17:39,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:17:39,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:17:39,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:17:39,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:17:39,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:17:39,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:17:39" (1/1) ... [2019-12-18 13:17:39,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bfb380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:39, skipping insertion in model container [2019-12-18 13:17:39,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:17:39" (1/1) ... [2019-12-18 13:17:39,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:17:40,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:17:40,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:17:40,578 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:17:40,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:17:40,730 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:17:40,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40 WrapperNode [2019-12-18 13:17:40,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:17:40,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:17:40,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:17:40,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:17:40,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:17:40,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:17:40,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:17:40,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:17:40,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (1/1) ... [2019-12-18 13:17:40,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:17:40,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:17:40,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:17:40,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:17:40,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (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 13:17:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:17:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:17:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:17:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:17:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:17:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:17:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:17:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:17:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:17:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:17:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:17:40,940 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 13:17:41,815 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:17:41,816 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:17:41,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:17:41 BoogieIcfgContainer [2019-12-18 13:17:41,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:17:41,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:17:41,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:17:41,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:17:41,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:17:39" (1/3) ... [2019-12-18 13:17:41,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeb8d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:17:41, skipping insertion in model container [2019-12-18 13:17:41,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:17:40" (2/3) ... [2019-12-18 13:17:41,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeb8d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:17:41, skipping insertion in model container [2019-12-18 13:17:41,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:17:41" (3/3) ... [2019-12-18 13:17:41,830 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2019-12-18 13:17:41,841 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:17:41,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:17:41,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:17:41,854 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:17:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,908 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,926 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:41,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:17:42,022 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:17:42,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:17:42,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:17:42,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:17:42,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:17:42,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:17:42,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:17:42,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:17:42,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:17:42,059 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-18 13:17:42,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 13:17:42,150 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 13:17:42,150 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:17:42,174 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:17:42,195 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-18 13:17:42,271 INFO L126 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-18 13:17:42,271 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:17:42,281 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:17:42,301 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:17:42,302 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:17:47,364 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 13:17:47,475 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 13:17:47,706 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-12-18 13:17:47,706 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 13:17:47,710 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-18 13:17:48,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-12-18 13:17:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-12-18 13:17:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:17:48,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:48,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:17:48,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-12-18 13:17:48,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:48,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884710346] [2019-12-18 13:17:48,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:48,467 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 13:17:48,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884710346] [2019-12-18 13:17:48,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:48,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:17:48,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954593639] [2019-12-18 13:17:48,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:48,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:48,493 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-12-18 13:17:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:48,740 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-12-18 13:17:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:48,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:17:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:48,837 INFO L225 Difference]: With dead ends: 8598 [2019-12-18 13:17:48,838 INFO L226 Difference]: Without dead ends: 7662 [2019-12-18 13:17:48,839 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 13:17:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-12-18 13:17:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-12-18 13:17:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-12-18 13:17:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-12-18 13:17:49,346 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-12-18 13:17:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:49,346 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-12-18 13:17:49,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-12-18 13:17:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:17:49,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:49,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:49,351 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-12-18 13:17:49,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:49,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173432238] [2019-12-18 13:17:49,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:49,444 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 13:17:49,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173432238] [2019-12-18 13:17:49,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:49,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:49,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987007588] [2019-12-18 13:17:49,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:49,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:49,447 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-12-18 13:17:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:49,485 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-12-18 13:17:49,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:49,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:17:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:49,493 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 13:17:49,493 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 13:17:49,496 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 13:17:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 13:17:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 13:17:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 13:17:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-12-18 13:17:49,531 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-12-18 13:17:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:49,531 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-12-18 13:17:49,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-12-18 13:17:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:17:49,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:49,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:49,539 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-12-18 13:17:49,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:49,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449075389] [2019-12-18 13:17:49,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:49,634 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 13:17:49,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449075389] [2019-12-18 13:17:49,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:49,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:49,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807799118] [2019-12-18 13:17:49,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:49,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:49,637 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-12-18 13:17:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:49,697 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-12-18 13:17:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:49,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 13:17:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:49,708 INFO L225 Difference]: With dead ends: 1943 [2019-12-18 13:17:49,708 INFO L226 Difference]: Without dead ends: 1943 [2019-12-18 13:17:49,709 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 13:17:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-12-18 13:17:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-12-18 13:17:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-18 13:17:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-12-18 13:17:49,750 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-12-18 13:17:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:49,751 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-12-18 13:17:49,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-12-18 13:17:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:17:49,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:49,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:49,753 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-12-18 13:17:49,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:49,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346826195] [2019-12-18 13:17:49,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:49,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 13:17:49,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346826195] [2019-12-18 13:17:49,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:49,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:49,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044522450] [2019-12-18 13:17:49,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:49,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:49,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:49,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:49,822 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-12-18 13:17:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:49,996 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-12-18 13:17:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:49,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:17:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:50,005 INFO L225 Difference]: With dead ends: 1724 [2019-12-18 13:17:50,006 INFO L226 Difference]: Without dead ends: 1724 [2019-12-18 13:17:50,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-18 13:17:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-12-18 13:17:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-18 13:17:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-12-18 13:17:50,046 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-12-18 13:17:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:50,046 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-12-18 13:17:50,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-12-18 13:17:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:17:50,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:50,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:50,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-12-18 13:17:50,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:50,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815746009] [2019-12-18 13:17:50,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:50,097 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 13:17:50,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815746009] [2019-12-18 13:17:50,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:50,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:50,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121143474] [2019-12-18 13:17:50,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:50,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:50,099 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-12-18 13:17:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:50,277 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-12-18 13:17:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:50,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:17:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:50,287 INFO L225 Difference]: With dead ends: 1991 [2019-12-18 13:17:50,288 INFO L226 Difference]: Without dead ends: 1991 [2019-12-18 13:17:50,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-18 13:17:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-12-18 13:17:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-12-18 13:17:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-12-18 13:17:50,332 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-12-18 13:17:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:50,333 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-12-18 13:17:50,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-12-18 13:17:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:17:50,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:50,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:50,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:50,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:50,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-12-18 13:17:50,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:50,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858293116] [2019-12-18 13:17:50,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:50,458 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 13:17:50,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858293116] [2019-12-18 13:17:50,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:50,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:50,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650318558] [2019-12-18 13:17:50,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:50,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:50,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:50,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:50,462 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-12-18 13:17:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:50,790 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-12-18 13:17:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:17:50,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 13:17:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:50,803 INFO L225 Difference]: With dead ends: 2258 [2019-12-18 13:17:50,803 INFO L226 Difference]: Without dead ends: 2258 [2019-12-18 13:17:50,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-12-18 13:17:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-12-18 13:17:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-12-18 13:17:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-12-18 13:17:50,846 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-12-18 13:17:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:50,847 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-12-18 13:17:50,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-12-18 13:17:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:17:50,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:50,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:50,850 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-12-18 13:17:50,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:50,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256990642] [2019-12-18 13:17:50,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:50,895 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 13:17:50,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256990642] [2019-12-18 13:17:50,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:50,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:17:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099241649] [2019-12-18 13:17:50,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:50,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:50,897 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-12-18 13:17:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:50,909 INFO L93 Difference]: Finished difference Result 2001 states and 4500 transitions. [2019-12-18 13:17:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:50,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 13:17:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:50,915 INFO L225 Difference]: With dead ends: 2001 [2019-12-18 13:17:50,915 INFO L226 Difference]: Without dead ends: 2001 [2019-12-18 13:17:50,915 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 13:17:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-12-18 13:17:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2019-12-18 13:17:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-18 13:17:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4500 transitions. [2019-12-18 13:17:50,954 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4500 transitions. Word has length 26 [2019-12-18 13:17:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:50,954 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4500 transitions. [2019-12-18 13:17:50,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4500 transitions. [2019-12-18 13:17:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:17:50,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:50,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:50,957 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-12-18 13:17:50,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:50,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881540161] [2019-12-18 13:17:50,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:51,053 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 13:17:51,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881540161] [2019-12-18 13:17:51,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:51,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:17:51,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686227253] [2019-12-18 13:17:51,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:51,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:51,056 INFO L87 Difference]: Start difference. First operand 2001 states and 4500 transitions. Second operand 5 states. [2019-12-18 13:17:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:51,118 INFO L93 Difference]: Finished difference Result 2103 states and 4690 transitions. [2019-12-18 13:17:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:51,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:17:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:51,124 INFO L225 Difference]: With dead ends: 2103 [2019-12-18 13:17:51,124 INFO L226 Difference]: Without dead ends: 2103 [2019-12-18 13:17:51,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-12-18 13:17:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2103. [2019-12-18 13:17:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2103 states. [2019-12-18 13:17:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 4690 transitions. [2019-12-18 13:17:51,165 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 4690 transitions. Word has length 26 [2019-12-18 13:17:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:51,165 INFO L462 AbstractCegarLoop]: Abstraction has 2103 states and 4690 transitions. [2019-12-18 13:17:51,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 4690 transitions. [2019-12-18 13:17:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:17:51,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:51,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:51,169 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1750039425, now seen corresponding path program 1 times [2019-12-18 13:17:51,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:51,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968712154] [2019-12-18 13:17:51,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:51,251 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 13:17:51,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968712154] [2019-12-18 13:17:51,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:51,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:17:51,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803450147] [2019-12-18 13:17:51,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:51,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:51,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:51,254 INFO L87 Difference]: Start difference. First operand 2103 states and 4690 transitions. Second operand 5 states. [2019-12-18 13:17:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:51,699 INFO L93 Difference]: Finished difference Result 2987 states and 6548 transitions. [2019-12-18 13:17:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:17:51,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:17:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:51,705 INFO L225 Difference]: With dead ends: 2987 [2019-12-18 13:17:51,706 INFO L226 Difference]: Without dead ends: 2987 [2019-12-18 13:17:51,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:17:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2019-12-18 13:17:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2570. [2019-12-18 13:17:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-18 13:17:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 5722 transitions. [2019-12-18 13:17:51,757 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 5722 transitions. Word has length 27 [2019-12-18 13:17:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:51,757 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 5722 transitions. [2019-12-18 13:17:51,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 5722 transitions. [2019-12-18 13:17:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:17:51,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:51,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:51,762 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1454990422, now seen corresponding path program 1 times [2019-12-18 13:17:51,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:51,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266480616] [2019-12-18 13:17:51,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:51,849 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 13:17:51,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266480616] [2019-12-18 13:17:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:51,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153696508] [2019-12-18 13:17:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:51,851 INFO L87 Difference]: Start difference. First operand 2570 states and 5722 transitions. Second operand 5 states. [2019-12-18 13:17:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:52,170 INFO L93 Difference]: Finished difference Result 3072 states and 6694 transitions. [2019-12-18 13:17:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:17:52,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:17:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:52,179 INFO L225 Difference]: With dead ends: 3072 [2019-12-18 13:17:52,179 INFO L226 Difference]: Without dead ends: 3072 [2019-12-18 13:17:52,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 13:17:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-12-18 13:17:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2505. [2019-12-18 13:17:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-12-18 13:17:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5590 transitions. [2019-12-18 13:17:52,235 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5590 transitions. Word has length 27 [2019-12-18 13:17:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:52,235 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 5590 transitions. [2019-12-18 13:17:52,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5590 transitions. [2019-12-18 13:17:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:17:52,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:52,240 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] [2019-12-18 13:17:52,240 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-12-18 13:17:52,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:52,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082025589] [2019-12-18 13:17:52,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:52,300 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 13:17:52,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082025589] [2019-12-18 13:17:52,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:52,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:52,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939562517] [2019-12-18 13:17:52,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:52,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:52,303 INFO L87 Difference]: Start difference. First operand 2505 states and 5590 transitions. Second operand 4 states. [2019-12-18 13:17:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:52,328 INFO L93 Difference]: Finished difference Result 1400 states and 2990 transitions. [2019-12-18 13:17:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:52,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 13:17:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:52,332 INFO L225 Difference]: With dead ends: 1400 [2019-12-18 13:17:52,333 INFO L226 Difference]: Without dead ends: 1400 [2019-12-18 13:17:52,333 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 13:17:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-18 13:17:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1305. [2019-12-18 13:17:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-12-18 13:17:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2815 transitions. [2019-12-18 13:17:52,360 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2815 transitions. Word has length 28 [2019-12-18 13:17:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:52,360 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 2815 transitions. [2019-12-18 13:17:52,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2815 transitions. [2019-12-18 13:17:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 13:17:52,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:52,365 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] [2019-12-18 13:17:52,365 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-12-18 13:17:52,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:52,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346542013] [2019-12-18 13:17:52,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:52,522 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 13:17:52,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346542013] [2019-12-18 13:17:52,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:52,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:52,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997764080] [2019-12-18 13:17:52,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:52,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:52,524 INFO L87 Difference]: Start difference. First operand 1305 states and 2815 transitions. Second operand 7 states. [2019-12-18 13:17:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:52,826 INFO L93 Difference]: Finished difference Result 3479 states and 7322 transitions. [2019-12-18 13:17:52,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:17:52,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 13:17:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:52,835 INFO L225 Difference]: With dead ends: 3479 [2019-12-18 13:17:52,835 INFO L226 Difference]: Without dead ends: 2269 [2019-12-18 13:17:52,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:17:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-12-18 13:17:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1348. [2019-12-18 13:17:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-18 13:17:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2908 transitions. [2019-12-18 13:17:52,880 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2908 transitions. Word has length 50 [2019-12-18 13:17:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:52,880 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2908 transitions. [2019-12-18 13:17:52,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2908 transitions. [2019-12-18 13:17:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 13:17:52,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:52,884 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] [2019-12-18 13:17:52,885 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1410793752, now seen corresponding path program 2 times [2019-12-18 13:17:52,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:52,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347827886] [2019-12-18 13:17:52,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:52,963 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 13:17:52,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347827886] [2019-12-18 13:17:52,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:52,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:52,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581785475] [2019-12-18 13:17:52,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:52,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:52,965 INFO L87 Difference]: Start difference. First operand 1348 states and 2908 transitions. Second operand 3 states. [2019-12-18 13:17:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:53,024 INFO L93 Difference]: Finished difference Result 1629 states and 3459 transitions. [2019-12-18 13:17:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:53,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 13:17:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:53,030 INFO L225 Difference]: With dead ends: 1629 [2019-12-18 13:17:53,030 INFO L226 Difference]: Without dead ends: 1629 [2019-12-18 13:17:53,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:17:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-12-18 13:17:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1368. [2019-12-18 13:17:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-18 13:17:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2946 transitions. [2019-12-18 13:17:53,063 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2946 transitions. Word has length 50 [2019-12-18 13:17:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:53,063 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2946 transitions. [2019-12-18 13:17:53,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2946 transitions. [2019-12-18 13:17:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:17:53,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:53,068 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] [2019-12-18 13:17:53,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:53,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1876939711, now seen corresponding path program 1 times [2019-12-18 13:17:53,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:53,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887315122] [2019-12-18 13:17:53,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:53,388 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 13:17:53,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887315122] [2019-12-18 13:17:53,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:53,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:17:53,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372491396] [2019-12-18 13:17:53,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:53,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:53,391 INFO L87 Difference]: Start difference. First operand 1368 states and 2946 transitions. Second operand 11 states. [2019-12-18 13:17:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:54,476 INFO L93 Difference]: Finished difference Result 1933 states and 3975 transitions. [2019-12-18 13:17:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:17:54,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-12-18 13:17:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:54,482 INFO L225 Difference]: With dead ends: 1933 [2019-12-18 13:17:54,483 INFO L226 Difference]: Without dead ends: 1933 [2019-12-18 13:17:54,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:17:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-18 13:17:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1266. [2019-12-18 13:17:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-18 13:17:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2686 transitions. [2019-12-18 13:17:54,509 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 2686 transitions. Word has length 51 [2019-12-18 13:17:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:54,509 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 2686 transitions. [2019-12-18 13:17:54,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 2686 transitions. [2019-12-18 13:17:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:17:54,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:54,513 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] [2019-12-18 13:17:54,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1053790121, now seen corresponding path program 2 times [2019-12-18 13:17:54,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:54,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158045481] [2019-12-18 13:17:54,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:54,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158045481] [2019-12-18 13:17:54,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:54,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:54,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862554350] [2019-12-18 13:17:54,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:54,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:54,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:54,580 INFO L87 Difference]: Start difference. First operand 1266 states and 2686 transitions. Second operand 3 states. [2019-12-18 13:17:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:54,596 INFO L93 Difference]: Finished difference Result 1265 states and 2684 transitions. [2019-12-18 13:17:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:54,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:17:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:54,600 INFO L225 Difference]: With dead ends: 1265 [2019-12-18 13:17:54,600 INFO L226 Difference]: Without dead ends: 1265 [2019-12-18 13:17:54,601 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 13:17:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-18 13:17:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1007. [2019-12-18 13:17:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-12-18 13:17:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 2166 transitions. [2019-12-18 13:17:54,622 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 2166 transitions. Word has length 51 [2019-12-18 13:17:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:54,623 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 2166 transitions. [2019-12-18 13:17:54,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 2166 transitions. [2019-12-18 13:17:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:17:54,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:54,626 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] [2019-12-18 13:17:54,626 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 1 times [2019-12-18 13:17:54,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:54,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560574883] [2019-12-18 13:17:54,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:54,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:17:54,748 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:17:54,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35|) 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t901~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t901~0.base_35| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t901~0.base_35|) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t901~0.base_35|) |v_ULTIMATE.start_main_~#t901~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t901~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_~#t901~0.base=|v_ULTIMATE.start_main_~#t901~0.base_35|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_~#t901~0.offset=|v_ULTIMATE.start_main_~#t901~0.offset_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t901~0.base, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t902~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t901~0.offset, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:17:54,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t902~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13| 1) |v_#valid_29|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t902~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t902~0.offset_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t902~0.base_13|) |v_ULTIMATE.start_main_~#t902~0.offset_11| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t902~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t902~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t902~0.offset=|v_ULTIMATE.start_main_~#t902~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t902~0.base=|v_ULTIMATE.start_main_~#t902~0.base_13|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t902~0.offset, ULTIMATE.start_main_~#t902~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:17:54,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1414285240| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1414285240) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1414285240| P0Thread1of1ForFork0_~arg.offset_Out-1414285240) (= (mod ~z$w_buff1_used~0_Out-1414285240 256) 0) (= 1 ~z$w_buff0~0_Out-1414285240) (= ~z$w_buff0_used~0_Out-1414285240 1) (= ~z$w_buff1_used~0_Out-1414285240 ~z$w_buff0_used~0_In-1414285240) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1414285240| 1) (= |P0Thread1of1ForFork0_#in~arg.base_In-1414285240| P0Thread1of1ForFork0_~arg.base_Out-1414285240) (= ~z$w_buff0~0_In-1414285240 ~z$w_buff1~0_Out-1414285240)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1414285240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1414285240, ~z$w_buff0~0=~z$w_buff0~0_In-1414285240, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1414285240|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1414285240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1414285240, ~z$w_buff0~0=~z$w_buff0~0_Out-1414285240, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1414285240, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1414285240, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1414285240|, ~z$w_buff1~0=~z$w_buff1~0_Out-1414285240, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1414285240, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1414285240|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1414285240} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:17:54,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2141593478 256)))) (or (and (= ~z$w_buff1_used~0_In2141593478 |P1Thread1of1ForFork1_#t~ite23_Out2141593478|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In2141593478 256) 0))) (or (and (= (mod ~z$r_buff1_thd2~0_In2141593478 256) 0) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In2141593478 256) 0)) (= (mod ~z$w_buff0_used~0_In2141593478 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out2141593478| |P1Thread1of1ForFork1_#t~ite24_Out2141593478|)) (and (= ~z$w_buff1_used~0_In2141593478 |P1Thread1of1ForFork1_#t~ite24_Out2141593478|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In2141593478| |P1Thread1of1ForFork1_#t~ite23_Out2141593478|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2141593478, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2141593478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141593478, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In2141593478|, ~weak$$choice2~0=~weak$$choice2~0_In2141593478, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2141593478} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2141593478, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2141593478, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out2141593478|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2141593478, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out2141593478|, ~weak$$choice2~0=~weak$$choice2~0_In2141593478, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2141593478} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 13:17:54,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite29_47| |v_P1Thread1of1ForFork1_#t~ite29_46|) (= |v_P1Thread1of1ForFork1_#t~ite28_51| |v_P1Thread1of1ForFork1_#t~ite28_50|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_40|) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_47|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_51|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_46|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_40|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_26|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_50|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_31|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 13:17:54,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:17:54,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-556186289 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-556186289 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-556186289|)) (and (= ~z$w_buff0_used~0_In-556186289 |P0Thread1of1ForFork0_#t~ite5_Out-556186289|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-556186289, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-556186289} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-556186289|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-556186289, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-556186289} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:17:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In258517501 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In258517501 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In258517501 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In258517501 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out258517501|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out258517501| ~z$w_buff1_used~0_In258517501)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In258517501, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In258517501, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258517501, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In258517501} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out258517501|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258517501, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In258517501, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258517501, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In258517501} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:17:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In277302095 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In277302095 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In277302095 ~z$r_buff0_thd1~0_Out277302095)) (and (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out277302095) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In277302095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In277302095} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In277302095, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out277302095|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out277302095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:17:54,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1481307941 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1481307941 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1481307941 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1481307941 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1481307941|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1481307941| ~z$r_buff1_thd1~0_In-1481307941) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1481307941, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1481307941, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1481307941, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1481307941} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1481307941, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1481307941|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1481307941, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1481307941, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1481307941} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:17:54,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In904746279 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In904746279 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out904746279| |P1Thread1of1ForFork1_#t~ite32_Out904746279|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In904746279 |P1Thread1of1ForFork1_#t~ite32_Out904746279|)) (and (not .cse1) (= ~z$w_buff1~0_In904746279 |P1Thread1of1ForFork1_#t~ite32_Out904746279|) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In904746279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In904746279, ~z$w_buff1~0=~z$w_buff1~0_In904746279, ~z~0=~z~0_In904746279} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In904746279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In904746279, ~z$w_buff1~0=~z$w_buff1~0_In904746279, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out904746279|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out904746279|, ~z~0=~z~0_In904746279} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:17:54,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-39810674 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-39810674 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-39810674| ~z$w_buff0_used~0_In-39810674) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-39810674| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-39810674, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-39810674} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-39810674, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-39810674|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-39810674} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:17:54,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd2~0_In-1911458407 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1911458407 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1911458407 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1911458407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1911458407|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1911458407 |P1Thread1of1ForFork1_#t~ite35_Out-1911458407|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911458407, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1911458407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1911458407, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1911458407} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1911458407, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1911458407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1911458407, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1911458407|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1911458407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:17:54,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-984451435 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-984451435 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-984451435|)) (and (= ~z$r_buff0_thd2~0_In-984451435 |P1Thread1of1ForFork1_#t~ite36_Out-984451435|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-984451435, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-984451435} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-984451435, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-984451435, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-984451435|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:17:54,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1766435314 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1766435314 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1766435314 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1766435314 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1766435314| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1766435314| ~z$r_buff1_thd2~0_In1766435314)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1766435314, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1766435314, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1766435314, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1766435314} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1766435314, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1766435314, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1766435314, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1766435314, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1766435314|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:17:54,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:17:54,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:17:54,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= 2 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:17:54,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2046980321 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2046980321 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In2046980321 |ULTIMATE.start_main_#t~ite40_Out2046980321|) (not .cse1)) (and (= ~z~0_In2046980321 |ULTIMATE.start_main_#t~ite40_Out2046980321|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2046980321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2046980321, ~z$w_buff1~0=~z$w_buff1~0_In2046980321, ~z~0=~z~0_In2046980321} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2046980321|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2046980321, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2046980321, ~z$w_buff1~0=~z$w_buff1~0_In2046980321, ~z~0=~z~0_In2046980321} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:17:54,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-18 13:17:54,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1646207386 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1646207386 256)))) (or (and (= ~z$w_buff0_used~0_In1646207386 |ULTIMATE.start_main_#t~ite42_Out1646207386|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1646207386| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1646207386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1646207386} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1646207386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1646207386, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1646207386|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:17:54,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In603144562 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In603144562 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In603144562 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In603144562 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out603144562| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In603144562 |ULTIMATE.start_main_#t~ite43_Out603144562|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In603144562, ~z$w_buff0_used~0=~z$w_buff0_used~0_In603144562, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In603144562, ~z$w_buff1_used~0=~z$w_buff1_used~0_In603144562} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In603144562, ~z$w_buff0_used~0=~z$w_buff0_used~0_In603144562, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In603144562, ~z$w_buff1_used~0=~z$w_buff1_used~0_In603144562, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out603144562|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:17:54,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1353565368 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1353565368 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1353565368|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1353565368 |ULTIMATE.start_main_#t~ite44_Out1353565368|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1353565368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1353565368} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1353565368, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1353565368, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1353565368|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:17:54,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1863118974 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1863118974 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1863118974 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1863118974 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1863118974| ~z$r_buff1_thd0~0_In1863118974) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1863118974|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1863118974, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1863118974, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1863118974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1863118974} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1863118974, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1863118974, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1863118974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1863118974, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1863118974|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:17:54,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= 1 v_~__unbuffered_p1_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:17:54,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:17:54 BasicIcfg [2019-12-18 13:17:54,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:17:54,873 INFO L168 Benchmark]: Toolchain (without parser) took 14914.16 ms. Allocated memory was 146.3 MB in the beginning and 428.9 MB in the end (delta: 282.6 MB). Free memory was 101.7 MB in the beginning and 158.0 MB in the end (delta: -56.3 MB). Peak memory consumption was 226.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,874 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.70 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 157.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.52 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,880 INFO L168 Benchmark]: Boogie Preprocessor took 64.54 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,882 INFO L168 Benchmark]: RCFGBuilder took 963.71 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.2 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,883 INFO L168 Benchmark]: TraceAbstraction took 13052.27 ms. Allocated memory was 203.4 MB in the beginning and 428.9 MB in the end (delta: 225.4 MB). Free memory was 108.2 MB in the beginning and 158.0 MB in the end (delta: -49.8 MB). Peak memory consumption was 175.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:54,892 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.74 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.70 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 157.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.52 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.54 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 963.71 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 108.2 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13052.27 ms. Allocated memory was 203.4 MB in the beginning and 428.9 MB in the end (delta: 225.4 MB). Free memory was 108.2 MB in the beginning and 158.0 MB in the end (delta: -49.8 MB). Peak memory consumption was 175.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1866 SDtfs, 1552 SDslu, 3709 SDs, 0 SdLazy, 2383 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 4344 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 60007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...