/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:23:46,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:23:46,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:23:46,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:23:46,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:23:46,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:23:46,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:23:46,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:23:46,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:23:46,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:23:46,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:23:46,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:23:46,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:23:46,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:23:46,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:23:46,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:23:46,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:23:46,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:23:46,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:23:46,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:23:46,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:23:46,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:23:46,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:23:46,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:23:46,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:23:46,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:23:46,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:23:46,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:23:46,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:23:46,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:23:46,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:23:46,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:23:46,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:23:46,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:23:46,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:23:46,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:23:46,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:23:46,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:23:46,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:23:46,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:23:46,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:23:46,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:23:46,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:23:46,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:23:46,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:23:46,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:23:46,793 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:23:46,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:23:46,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:23:46,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:23:46,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:23:46,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:23:46,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:23:46,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:23:46,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:23:46,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:23:46,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:23:46,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:23:46,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:23:46,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:23:46,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:23:46,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:23:46,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:23:46,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:23:46,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:23:46,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:23:46,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:23:46,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:23:46,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:23:46,798 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:23:46,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:23:46,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:23:47,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:23:47,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:23:47,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:23:47,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:23:47,106 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:23:47,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-27 05:23:47,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011b1aa7a/8e973cf024834e73902e61748b226a77/FLAGbc11bb3b1 [2019-12-27 05:23:47,716 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:23:47,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.opt.i [2019-12-27 05:23:47,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011b1aa7a/8e973cf024834e73902e61748b226a77/FLAGbc11bb3b1 [2019-12-27 05:23:48,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011b1aa7a/8e973cf024834e73902e61748b226a77 [2019-12-27 05:23:48,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:23:48,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:23:48,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:23:48,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:23:48,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:23:48,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a8adc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48, skipping insertion in model container [2019-12-27 05:23:48,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:23:48,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:23:48,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:23:48,676 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:23:48,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:23:48,826 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:23:48,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48 WrapperNode [2019-12-27 05:23:48,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:23:48,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:23:48,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:23:48,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:23:48,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:23:48,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:23:48,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:23:48,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:23:48,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... [2019-12-27 05:23:48,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:23:48,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:23:48,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:23:48,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:23:48,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:23:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:23:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:23:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:23:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:23:49,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:23:49,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:23:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:23:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:23:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:23:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:23:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:23:49,007 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:23:49,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:23:49,647 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:23:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:23:49 BoogieIcfgContainer [2019-12-27 05:23:49,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:23:49,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:23:49,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:23:49,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:23:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:23:48" (1/3) ... [2019-12-27 05:23:49,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33539bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:23:49, skipping insertion in model container [2019-12-27 05:23:49,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:48" (2/3) ... [2019-12-27 05:23:49,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33539bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:23:49, skipping insertion in model container [2019-12-27 05:23:49,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:23:49" (3/3) ... [2019-12-27 05:23:49,660 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.opt.i [2019-12-27 05:23:49,671 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:23:49,671 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:23:49,683 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:23:49,684 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:23:49,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,757 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,832 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:49,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:23:49,867 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:23:49,867 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:23:49,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:23:49,868 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:23:49,868 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:23:49,868 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:23:49,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:23:49,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:23:49,884 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 05:23:49,886 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 05:23:49,973 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 05:23:49,974 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:23:49,990 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:23:50,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 05:23:50,056 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 05:23:50,056 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:23:50,062 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:23:50,076 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 05:23:50,077 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:23:53,478 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 05:23:53,598 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 05:23:53,627 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-27 05:23:53,627 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 05:23:53,631 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 05:23:54,121 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-27 05:23:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-27 05:23:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:23:54,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:54,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:23:54,131 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 05:23:54,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:54,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535108531] [2019-12-27 05:23:54,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:54,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535108531] [2019-12-27 05:23:54,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:54,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:23:54,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650744407] [2019-12-27 05:23:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:54,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:54,383 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-27 05:23:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:54,674 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-27 05:23:54,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:54,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:23:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:54,757 INFO L225 Difference]: With dead ends: 8205 [2019-12-27 05:23:54,758 INFO L226 Difference]: Without dead ends: 7724 [2019-12-27 05:23:54,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-27 05:23:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-27 05:23:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-27 05:23:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-27 05:23:55,353 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-27 05:23:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:55,353 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-27 05:23:55,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-27 05:23:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:23:55,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:55,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:55,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 05:23:55,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:55,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272963749] [2019-12-27 05:23:55,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:55,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272963749] [2019-12-27 05:23:55,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:55,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:55,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071570954] [2019-12-27 05:23:55,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:55,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:55,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:55,433 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-27 05:23:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:55,455 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-27 05:23:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:55,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 05:23:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:55,462 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 05:23:55,462 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 05:23:55,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 05:23:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 05:23:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 05:23:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-27 05:23:55,494 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-27 05:23:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:55,495 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-27 05:23:55,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-27 05:23:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:23:55,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:55,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:55,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:55,497 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 05:23:55,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:55,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987073262] [2019-12-27 05:23:55,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:55,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987073262] [2019-12-27 05:23:55,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:55,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:55,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545040296] [2019-12-27 05:23:55,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:23:55,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:23:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:55,656 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-27 05:23:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:55,928 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-27 05:23:55,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:23:55,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 05:23:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:55,943 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 05:23:55,943 INFO L226 Difference]: Without dead ends: 1827 [2019-12-27 05:23:55,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:23:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-27 05:23:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-27 05:23:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-27 05:23:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-27 05:23:56,004 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-27 05:23:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:56,005 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-27 05:23:56,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:23:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-27 05:23:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:23:56,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:56,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:56,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-27 05:23:56,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:56,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254992271] [2019-12-27 05:23:56,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:56,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254992271] [2019-12-27 05:23:56,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:56,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:23:56,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945329223] [2019-12-27 05:23:56,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:23:56,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:23:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:23:56,181 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-27 05:23:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:56,551 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-27 05:23:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:23:56,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 05:23:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:56,564 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 05:23:56,564 INFO L226 Difference]: Without dead ends: 2335 [2019-12-27 05:23:56,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:23:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-27 05:23:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-27 05:23:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 05:23:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-27 05:23:56,612 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-27 05:23:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-27 05:23:56,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:23:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-27 05:23:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:23:56,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:56,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:56,615 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:56,615 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 05:23:56,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:56,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74769320] [2019-12-27 05:23:56,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:56,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74769320] [2019-12-27 05:23:56,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:56,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:23:56,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316617894] [2019-12-27 05:23:56,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:56,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:56,679 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-27 05:23:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:56,693 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-27 05:23:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:56,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 05:23:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:56,703 INFO L225 Difference]: With dead ends: 1702 [2019-12-27 05:23:56,703 INFO L226 Difference]: Without dead ends: 1702 [2019-12-27 05:23:56,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-27 05:23:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-27 05:23:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 05:23:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-27 05:23:56,744 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-27 05:23:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:56,745 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-27 05:23:56,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-27 05:23:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:23:56,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:56,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:56,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 05:23:56,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:56,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409576511] [2019-12-27 05:23:56,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:56,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409576511] [2019-12-27 05:23:56,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:56,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:56,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890175025] [2019-12-27 05:23:56,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:23:56,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:23:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:56,891 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-27 05:23:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:56,923 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-27 05:23:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:23:56,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 05:23:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:56,936 INFO L225 Difference]: With dead ends: 2698 [2019-12-27 05:23:56,941 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 05:23:56,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 05:23:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-27 05:23:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-27 05:23:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-27 05:23:56,977 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-27 05:23:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:56,977 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-27 05:23:56,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:23:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-27 05:23:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:23:56,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:56,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:56,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 05:23:56,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:56,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480813443] [2019-12-27 05:23:56,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:57,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480813443] [2019-12-27 05:23:57,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:57,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:23:57,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155099714] [2019-12-27 05:23:57,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:23:57,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:57,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:23:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:57,100 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 5 states. [2019-12-27 05:23:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:57,560 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-27 05:23:57,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:23:57,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:23:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:57,569 INFO L225 Difference]: With dead ends: 1897 [2019-12-27 05:23:57,569 INFO L226 Difference]: Without dead ends: 1897 [2019-12-27 05:23:57,570 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-27 05:23:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-27 05:23:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-27 05:23:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 05:23:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-27 05:23:57,613 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-27 05:23:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:57,613 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-27 05:23:57,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:23:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-27 05:23:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:23:57,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:57,616 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-27 05:23:57,617 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 05:23:57,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:57,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433915038] [2019-12-27 05:23:57,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:57,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433915038] [2019-12-27 05:23:57,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:57,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:57,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480739668] [2019-12-27 05:23:57,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:23:57,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:23:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:57,663 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 4 states. [2019-12-27 05:23:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:57,680 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 05:23:57,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:23:57,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 05:23:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:57,684 INFO L225 Difference]: With dead ends: 921 [2019-12-27 05:23:57,684 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 05:23:57,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 05:23:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 05:23:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 05:23:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 05:23:57,703 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 05:23:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:57,703 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 05:23:57,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:23:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 05:23:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:23:57,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:57,706 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-27 05:23:57,706 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-27 05:23:57,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:57,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056551958] [2019-12-27 05:23:57,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056551958] [2019-12-27 05:23:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:57,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:23:57,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010368970] [2019-12-27 05:23:57,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:23:57,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:23:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:23:57,830 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-27 05:23:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:58,043 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 05:23:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:23:58,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 05:23:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:58,046 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 05:23:58,047 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 05:23:58,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:23:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 05:23:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 05:23:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 05:23:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 05:23:58,065 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-27 05:23:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:58,065 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 05:23:58,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:23:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 05:23:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:23:58,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:58,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-27 05:23:58,068 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-27 05:23:58,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:58,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600400664] [2019-12-27 05:23:58,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:58,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600400664] [2019-12-27 05:23:58,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:58,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:23:58,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522254677] [2019-12-27 05:23:58,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:23:58,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:23:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:23:58,247 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-27 05:23:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:58,816 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-27 05:23:58,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:23:58,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 05:23:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:58,821 INFO L225 Difference]: With dead ends: 1033 [2019-12-27 05:23:58,821 INFO L226 Difference]: Without dead ends: 1033 [2019-12-27 05:23:58,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:23:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-27 05:23:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 833. [2019-12-27 05:23:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-27 05:23:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1740 transitions. [2019-12-27 05:23:58,839 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1740 transitions. Word has length 51 [2019-12-27 05:23:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:58,839 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1740 transitions. [2019-12-27 05:23:58,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:23:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1740 transitions. [2019-12-27 05:23:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:23:58,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:58,842 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-27 05:23:58,842 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-27 05:23:58,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:58,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569329009] [2019-12-27 05:23:58,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:58,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569329009] [2019-12-27 05:23:58,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:58,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:58,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388424426] [2019-12-27 05:23:58,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:58,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:58,939 INFO L87 Difference]: Start difference. First operand 833 states and 1740 transitions. Second operand 3 states. [2019-12-27 05:23:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:58,993 INFO L93 Difference]: Finished difference Result 1106 states and 2316 transitions. [2019-12-27 05:23:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:58,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 05:23:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:58,996 INFO L225 Difference]: With dead ends: 1106 [2019-12-27 05:23:58,996 INFO L226 Difference]: Without dead ends: 1106 [2019-12-27 05:23:58,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-27 05:23:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 890. [2019-12-27 05:23:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 05:23:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1876 transitions. [2019-12-27 05:23:59,016 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1876 transitions. Word has length 51 [2019-12-27 05:23:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:59,017 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1876 transitions. [2019-12-27 05:23:59,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1876 transitions. [2019-12-27 05:23:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:23:59,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:59,020 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-27 05:23:59,020 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-27 05:23:59,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:59,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124676338] [2019-12-27 05:23:59,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:59,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124676338] [2019-12-27 05:23:59,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:59,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:59,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811226089] [2019-12-27 05:23:59,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:59,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:59,112 INFO L87 Difference]: Start difference. First operand 890 states and 1876 transitions. Second operand 3 states. [2019-12-27 05:23:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:59,126 INFO L93 Difference]: Finished difference Result 889 states and 1874 transitions. [2019-12-27 05:23:59,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:59,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:23:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:59,128 INFO L225 Difference]: With dead ends: 889 [2019-12-27 05:23:59,128 INFO L226 Difference]: Without dead ends: 889 [2019-12-27 05:23:59,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-12-27 05:23:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 795. [2019-12-27 05:23:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-27 05:23:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1696 transitions. [2019-12-27 05:23:59,145 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1696 transitions. Word has length 52 [2019-12-27 05:23:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:59,145 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1696 transitions. [2019-12-27 05:23:59,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1696 transitions. [2019-12-27 05:23:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 05:23:59,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:59,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:59,148 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-27 05:23:59,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:59,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206250989] [2019-12-27 05:23:59,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:23:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:23:59,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:23:59,333 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:23:59,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 v_~__unbuffered_cnt~0_17) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t307~0.base_22|) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= (select .cse0 |v_ULTIMATE.start_main_~#t307~0.base_22|) 0) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t307~0.base_22|) |v_ULTIMATE.start_main_~#t307~0.offset_17| 0)) |v_#memory_int_11|) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t307~0.base_22| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t307~0.base_22| 4)) (= v_~y$w_buff1_used~0_64 0) (= |v_ULTIMATE.start_main_~#t307~0.offset_17| 0) (= 0 v_~weak$$choice0~0_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ULTIMATE.start_main_~#t307~0.base=|v_ULTIMATE.start_main_~#t307~0.base_22|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t307~0.offset=|v_ULTIMATE.start_main_~#t307~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t308~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t307~0.base, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t308~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t307~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:23:59,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t308~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t308~0.base_10|) |v_ULTIMATE.start_main_~#t308~0.offset_9| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t308~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t308~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t308~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t308~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t308~0.base=|v_ULTIMATE.start_main_~#t308~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t308~0.offset=|v_ULTIMATE.start_main_~#t308~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t308~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t308~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 05:23:59,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd0~0_Out-783198806 ~y$r_buff0_thd0~0_In-783198806) (= ~y$r_buff0_thd1~0_In-783198806 ~y$r_buff1_thd1~0_Out-783198806) (= ~x~0_In-783198806 ~__unbuffered_p0_EAX~0_Out-783198806) (= 1 ~y$r_buff0_thd1~0_Out-783198806) (= ~y$r_buff1_thd2~0_Out-783198806 ~y$r_buff0_thd2~0_In-783198806) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-783198806))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-783198806, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-783198806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-783198806, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-783198806, ~x~0=~x~0_In-783198806} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-783198806, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-783198806, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-783198806, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-783198806, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-783198806, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-783198806, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-783198806, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-783198806, ~x~0=~x~0_In-783198806} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 05:23:59,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-752209158 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-752209158 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-752209158| ~y$w_buff0_used~0_In-752209158) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-752209158| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-752209158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-752209158} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-752209158|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752209158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-752209158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 05:23:59,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-296516821 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-296516821 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-296516821 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-296516821 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-296516821| ~y$w_buff1_used~0_In-296516821) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out-296516821| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-296516821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296516821, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-296516821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296516821} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-296516821|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-296516821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296516821, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-296516821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296516821} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 05:23:59,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In495209632 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In495209632 256)))) (or (and (= ~y$r_buff0_thd1~0_Out495209632 ~y$r_buff0_thd1~0_In495209632) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out495209632 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In495209632, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In495209632} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In495209632, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out495209632|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out495209632} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:23:59,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-2006992618 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2006992618 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-2006992618 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2006992618 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2006992618| ~y$r_buff1_thd1~0_In-2006992618) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2006992618| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2006992618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006992618, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2006992618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2006992618} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2006992618, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006992618, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2006992618|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2006992618, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2006992618} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:23:59,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:23:59,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1362677604 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out1362677604| ~y$w_buff1~0_In1362677604) (= |P1Thread1of1ForFork1_#t~ite17_In1362677604| |P1Thread1of1ForFork1_#t~ite17_Out1362677604|)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out1362677604| ~y$w_buff1~0_In1362677604) (= |P1Thread1of1ForFork1_#t~ite17_Out1362677604| |P1Thread1of1ForFork1_#t~ite18_Out1362677604|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1362677604 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1362677604 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1362677604 256))) (= (mod ~y$w_buff0_used~0_In1362677604 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1362677604, ~y$w_buff1~0=~y$w_buff1~0_In1362677604, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1362677604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1362677604, ~weak$$choice2~0=~weak$$choice2~0_In1362677604, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1362677604|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1362677604} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1362677604, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1362677604|, ~y$w_buff1~0=~y$w_buff1~0_In1362677604, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1362677604, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1362677604, ~weak$$choice2~0=~weak$$choice2~0_In1362677604, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1362677604|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1362677604} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 05:23:59,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1805285843 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1805285843| |P1Thread1of1ForFork1_#t~ite20_Out-1805285843|) (= ~y$w_buff0_used~0_In-1805285843 |P1Thread1of1ForFork1_#t~ite21_Out-1805285843|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1805285843| |P1Thread1of1ForFork1_#t~ite20_Out-1805285843|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1805285843 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-1805285843 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1805285843 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-1805285843 256)) .cse1))) (= ~y$w_buff0_used~0_In-1805285843 |P1Thread1of1ForFork1_#t~ite20_Out-1805285843|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1805285843, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805285843, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1805285843|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1805285843, ~weak$$choice2~0=~weak$$choice2~0_In-1805285843, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805285843} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1805285843, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1805285843, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1805285843|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1805285843, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1805285843|, ~weak$$choice2~0=~weak$$choice2~0_In-1805285843, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1805285843} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:23:59,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse4 (= (mod ~weak$$choice2~0_In-159754714 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-159754714 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-159754714 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-159754714| |P1Thread1of1ForFork1_#t~ite23_Out-159754714|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-159754714 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-159754714 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-159754714| |P1Thread1of1ForFork1_#t~ite22_Out-159754714|) (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) (= ~y$w_buff1_used~0_In-159754714 |P1Thread1of1ForFork1_#t~ite23_Out-159754714|) .cse4 .cse5) (and (not .cse4) (= |P1Thread1of1ForFork1_#t~ite24_Out-159754714| ~y$w_buff1_used~0_In-159754714) (= |P1Thread1of1ForFork1_#t~ite23_In-159754714| |P1Thread1of1ForFork1_#t~ite23_Out-159754714|)))) (let ((.cse6 (not .cse1))) (and .cse4 (or (not .cse3) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-159754714| |P1Thread1of1ForFork1_#t~ite23_Out-159754714|) (not .cse0) .cse5 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-159754714|) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-159754714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159754714, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-159754714, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-159754714|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-159754714|, ~weak$$choice2~0=~weak$$choice2~0_In-159754714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159754714} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-159754714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159754714, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-159754714, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-159754714|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-159754714|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-159754714|, ~weak$$choice2~0=~weak$$choice2~0_In-159754714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159754714} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 05:23:59,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 05:23:59,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2137230913 256)))) (or (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In2137230913 256) 0)))) (and .cse0 (or (not (= (mod ~y$r_buff1_thd2~0_In2137230913 256) 0)) .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out2137230913| 0) (not (= (mod ~y$w_buff0_used~0_In2137230913 256) 0)) (= |P1Thread1of1ForFork1_#t~ite30_Out2137230913| |P1Thread1of1ForFork1_#t~ite29_Out2137230913|) (= |P1Thread1of1ForFork1_#t~ite28_Out2137230913| |P1Thread1of1ForFork1_#t~ite29_Out2137230913|) (or (not (= 0 (mod ~y$w_buff1_used~0_In2137230913 256))) .cse1))) (and (= |P1Thread1of1ForFork1_#t~ite28_In2137230913| |P1Thread1of1ForFork1_#t~ite28_Out2137230913|) (= ~y$r_buff1_thd2~0_In2137230913 |P1Thread1of1ForFork1_#t~ite30_Out2137230913|) (= |P1Thread1of1ForFork1_#t~ite29_In2137230913| |P1Thread1of1ForFork1_#t~ite29_Out2137230913|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2137230913, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2137230913|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2137230913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2137230913, ~weak$$choice2~0=~weak$$choice2~0_In2137230913, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In2137230913|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2137230913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2137230913, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2137230913|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2137230913|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2137230913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2137230913, ~weak$$choice2~0=~weak$$choice2~0_In2137230913, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out2137230913|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2137230913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:23:59,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 05:23:59,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out1081812016| |P1Thread1of1ForFork1_#t~ite33_Out1081812016|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1081812016 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1081812016 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1081812016| ~y$w_buff1~0_In1081812016) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1081812016| ~y~0_In1081812016)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1081812016, ~y$w_buff1~0=~y$w_buff1~0_In1081812016, ~y~0=~y~0_In1081812016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1081812016} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1081812016, ~y$w_buff1~0=~y$w_buff1~0_In1081812016, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1081812016|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1081812016|, ~y~0=~y~0_In1081812016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1081812016} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 05:23:59,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1825601230 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1825601230 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1825601230|)) (and (= ~y$w_buff0_used~0_In1825601230 |P1Thread1of1ForFork1_#t~ite34_Out1825601230|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1825601230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1825601230} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1825601230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1825601230, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1825601230|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 05:23:59,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1517637436 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1517637436 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1517637436 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1517637436 256)))) (or (and (= ~y$w_buff1_used~0_In1517637436 |P1Thread1of1ForFork1_#t~ite35_Out1517637436|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1517637436|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1517637436, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1517637436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1517637436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1517637436} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1517637436, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1517637436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1517637436, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1517637436|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1517637436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 05:23:59,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1111902708 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1111902708 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1111902708| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1111902708| ~y$r_buff0_thd2~0_In-1111902708)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111902708, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111902708} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1111902708, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1111902708, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1111902708|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 05:23:59,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1991399956 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1991399956 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1991399956 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1991399956 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1991399956|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1991399956| ~y$r_buff1_thd2~0_In1991399956)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1991399956, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1991399956, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1991399956, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1991399956} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1991399956, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1991399956, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1991399956, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1991399956|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1991399956} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:23:59,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:23:59,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:23:59,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-458126506 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-458126506 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-458126506| ~y~0_In-458126506)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-458126506| ~y$w_buff1~0_In-458126506) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-458126506, ~y~0=~y~0_In-458126506, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-458126506, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458126506} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-458126506|, ~y$w_buff1~0=~y$w_buff1~0_In-458126506, ~y~0=~y~0_In-458126506, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-458126506, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458126506} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 05:23:59,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 05:23:59,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1344053765 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1344053765 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1344053765 |ULTIMATE.start_main_#t~ite42_Out-1344053765|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1344053765| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344053765, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1344053765} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344053765, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1344053765, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1344053765|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:23:59,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In788639601 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In788639601 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In788639601 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In788639601 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out788639601| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In788639601 |ULTIMATE.start_main_#t~ite43_Out788639601|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In788639601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In788639601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In788639601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In788639601} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In788639601, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In788639601, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out788639601|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In788639601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In788639601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:23:59,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1894840680 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1894840680 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1894840680| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1894840680| ~y$r_buff0_thd0~0_In-1894840680)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894840680, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1894840680} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894840680, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1894840680, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1894840680|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:23:59,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In863988401 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In863988401 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In863988401 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In863988401 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In863988401 |ULTIMATE.start_main_#t~ite45_Out863988401|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out863988401|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In863988401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In863988401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In863988401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In863988401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In863988401, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In863988401, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In863988401, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out863988401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In863988401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:23:59,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:23:59,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:23:59 BasicIcfg [2019-12-27 05:23:59,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:23:59,430 INFO L168 Benchmark]: Toolchain (without parser) took 11403.94 ms. Allocated memory was 138.4 MB in the beginning and 412.1 MB in the end (delta: 273.7 MB). Free memory was 101.2 MB in the beginning and 147.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 227.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,431 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 155.1 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,434 INFO L168 Benchmark]: Boogie Preprocessor took 43.21 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,434 INFO L168 Benchmark]: RCFGBuilder took 716.41 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 105.5 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,435 INFO L168 Benchmark]: TraceAbstraction took 9778.65 ms. Allocated memory was 202.9 MB in the beginning and 412.1 MB in the end (delta: 209.2 MB). Free memory was 105.5 MB in the beginning and 147.5 MB in the end (delta: -42.0 MB). Peak memory consumption was 167.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:59,440 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.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 155.1 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.21 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.41 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 105.5 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9778.65 ms. Allocated memory was 202.9 MB in the beginning and 412.1 MB in the end (delta: 209.2 MB). Free memory was 105.5 MB in the beginning and 147.5 MB in the end (delta: -42.0 MB). Peak memory consumption was 167.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t307, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1174 SDslu, 2515 SDs, 0 SdLazy, 1504 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 40156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...