/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/mix010_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:21:11,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:21:11,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:21:11,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:21:11,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:21:11,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:21:11,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:21:11,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:21:11,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:21:11,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:21:11,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:21:11,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:21:11,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:21:11,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:21:11,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:21:11,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:21:11,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:21:11,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:21:11,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:21:11,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:21:11,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:21:11,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:21:11,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:21:11,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:21:11,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:21:11,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:21:11,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:21:11,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:21:11,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:21:11,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:21:11,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:21:11,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:21:11,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:21:11,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:21:11,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:21:11,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:21:11,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:21:11,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:21:11,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:21:11,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:21:11,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:21:11,794 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:21:11,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:21:11,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:21:11,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:21:11,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:21:11,810 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:21:11,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:21:11,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:21:11,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:21:11,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:21:11,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:21:11,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:21:11,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:21:11,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:21:11,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:21:11,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:21:11,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:21:11,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:21:11,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:21:11,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:21:11,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:21:11,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:21:11,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:21:11,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:21:11,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:21:11,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:21:11,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:21:11,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:21:11,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:21:11,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:21:11,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:21:12,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:21:12,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:21:12,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:21:12,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:21:12,105 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:21:12,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2019-12-27 05:21:12,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837c7d48b/2cda316ca9334a00ad9bd842f2adf2d4/FLAG0390e63ca [2019-12-27 05:21:12,697 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:21:12,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2019-12-27 05:21:12,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837c7d48b/2cda316ca9334a00ad9bd842f2adf2d4/FLAG0390e63ca [2019-12-27 05:21:13,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837c7d48b/2cda316ca9334a00ad9bd842f2adf2d4 [2019-12-27 05:21:13,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:21:13,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:21:13,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:21:13,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:21:13,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:21:13,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13, skipping insertion in model container [2019-12-27 05:21:13,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:21:13,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:21:13,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:21:13,667 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:21:13,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:21:13,836 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:21:13,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13 WrapperNode [2019-12-27 05:21:13,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:21:13,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:21:13,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:21:13,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:21:13,847 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:21:13" (1/1) ... [2019-12-27 05:21:13,867 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:21:13" (1/1) ... [2019-12-27 05:21:13,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:21:13,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:21:13,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:21:13,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:21:13,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (1/1) ... [2019-12-27 05:21:13,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:21:13,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:21:13,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:21:13,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:21:13,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (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:21:14,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:21:14,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:21:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:21:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:21:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:21:14,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:21:14,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:21:14,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:21:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:21:14,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:21:14,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:21:14,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:21:14,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:21:14,037 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:21:14,812 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:21:14,813 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:21:14,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:21:14 BoogieIcfgContainer [2019-12-27 05:21:14,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:21:14,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:21:14,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:21:14,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:21:14,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:21:13" (1/3) ... [2019-12-27 05:21:14,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0b60e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:21:14, skipping insertion in model container [2019-12-27 05:21:14,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:21:13" (2/3) ... [2019-12-27 05:21:14,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0b60e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:21:14, skipping insertion in model container [2019-12-27 05:21:14,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:21:14" (3/3) ... [2019-12-27 05:21:14,823 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_tso.oepc.i [2019-12-27 05:21:14,833 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:21:14,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:21:14,840 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:21:14,841 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:21:14,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,890 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,916 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,944 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,954 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:21:14,978 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:21:14,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:21:14,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:21:14,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:21:14,995 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:21:14,995 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:21:14,995 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:21:14,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:21:14,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:21:15,013 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 05:21:15,015 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:21:15,120 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:21:15,121 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:21:15,143 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:21:15,166 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:21:15,219 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:21:15,219 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:21:15,227 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:21:15,249 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:21:15,250 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:21:18,067 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 05:21:18,449 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 05:21:18,557 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 05:21:18,854 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:21:19,001 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:21:19,043 INFO L206 etLargeBlockEncoding]: Checked pairs total: 95714 [2019-12-27 05:21:19,043 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 05:21:19,047 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 108 transitions [2019-12-27 05:21:44,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138242 states. [2019-12-27 05:21:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 138242 states. [2019-12-27 05:21:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:21:44,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:44,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:21:44,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:21:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash 917980, now seen corresponding path program 1 times [2019-12-27 05:21:44,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:44,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470453159] [2019-12-27 05:21:44,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:45,127 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:21:45,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470453159] [2019-12-27 05:21:45,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:45,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:21:45,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621475321] [2019-12-27 05:21:45,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:45,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:45,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:45,157 INFO L87 Difference]: Start difference. First operand 138242 states. Second operand 3 states. [2019-12-27 05:21:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:46,663 INFO L93 Difference]: Finished difference Result 137016 states and 586554 transitions. [2019-12-27 05:21:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:46,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:21:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:47,502 INFO L225 Difference]: With dead ends: 137016 [2019-12-27 05:21:47,502 INFO L226 Difference]: Without dead ends: 128980 [2019-12-27 05:21:47,503 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:21:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128980 states. [2019-12-27 05:22:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128980 to 128980. [2019-12-27 05:22:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128980 states. [2019-12-27 05:22:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128980 states to 128980 states and 551484 transitions. [2019-12-27 05:22:03,090 INFO L78 Accepts]: Start accepts. Automaton has 128980 states and 551484 transitions. Word has length 3 [2019-12-27 05:22:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:03,090 INFO L462 AbstractCegarLoop]: Abstraction has 128980 states and 551484 transitions. [2019-12-27 05:22:03,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 128980 states and 551484 transitions. [2019-12-27 05:22:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:22:03,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:03,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:03,096 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 178231614, now seen corresponding path program 1 times [2019-12-27 05:22:03,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:03,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455135707] [2019-12-27 05:22:03,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:03,234 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:22:03,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455135707] [2019-12-27 05:22:03,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:03,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:03,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321916860] [2019-12-27 05:22:03,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:03,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:03,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:03,238 INFO L87 Difference]: Start difference. First operand 128980 states and 551484 transitions. Second operand 4 states. [2019-12-27 05:22:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:08,542 INFO L93 Difference]: Finished difference Result 200378 states and 822381 transitions. [2019-12-27 05:22:08,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:22:08,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:22:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:09,199 INFO L225 Difference]: With dead ends: 200378 [2019-12-27 05:22:09,200 INFO L226 Difference]: Without dead ends: 200329 [2019-12-27 05:22:09,201 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:22:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200329 states. [2019-12-27 05:22:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200329 to 184385. [2019-12-27 05:22:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184385 states. [2019-12-27 05:22:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184385 states to 184385 states and 766782 transitions. [2019-12-27 05:22:22,712 INFO L78 Accepts]: Start accepts. Automaton has 184385 states and 766782 transitions. Word has length 11 [2019-12-27 05:22:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:22,713 INFO L462 AbstractCegarLoop]: Abstraction has 184385 states and 766782 transitions. [2019-12-27 05:22:22,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 184385 states and 766782 transitions. [2019-12-27 05:22:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:22:22,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:22,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:22,720 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash -786514357, now seen corresponding path program 1 times [2019-12-27 05:22:22,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:22,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475177582] [2019-12-27 05:22:22,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:22,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475177582] [2019-12-27 05:22:22,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:22,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:22,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454695216] [2019-12-27 05:22:22,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:22,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:22,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:22,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:22,774 INFO L87 Difference]: Start difference. First operand 184385 states and 766782 transitions. Second operand 3 states. [2019-12-27 05:22:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:22,917 INFO L93 Difference]: Finished difference Result 38211 states and 124394 transitions. [2019-12-27 05:22:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:22,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:22:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:23,031 INFO L225 Difference]: With dead ends: 38211 [2019-12-27 05:22:23,031 INFO L226 Difference]: Without dead ends: 38211 [2019-12-27 05:22:23,032 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:22:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-12-27 05:22:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38211. [2019-12-27 05:22:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38211 states. [2019-12-27 05:22:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38211 states to 38211 states and 124394 transitions. [2019-12-27 05:22:29,334 INFO L78 Accepts]: Start accepts. Automaton has 38211 states and 124394 transitions. Word has length 13 [2019-12-27 05:22:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:29,334 INFO L462 AbstractCegarLoop]: Abstraction has 38211 states and 124394 transitions. [2019-12-27 05:22:29,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38211 states and 124394 transitions. [2019-12-27 05:22:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:22:29,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:29,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:29,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1326052248, now seen corresponding path program 1 times [2019-12-27 05:22:29,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:29,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059363322] [2019-12-27 05:22:29,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:29,468 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:22:29,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059363322] [2019-12-27 05:22:29,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:29,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:29,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370753765] [2019-12-27 05:22:29,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:22:29,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:29,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:22:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:29,474 INFO L87 Difference]: Start difference. First operand 38211 states and 124394 transitions. Second operand 5 states. [2019-12-27 05:22:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:30,016 INFO L93 Difference]: Finished difference Result 52954 states and 170202 transitions. [2019-12-27 05:22:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:22:30,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:22:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:30,145 INFO L225 Difference]: With dead ends: 52954 [2019-12-27 05:22:30,146 INFO L226 Difference]: Without dead ends: 52954 [2019-12-27 05:22:30,146 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:22:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52954 states. [2019-12-27 05:22:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52954 to 45311. [2019-12-27 05:22:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45311 states. [2019-12-27 05:22:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45311 states to 45311 states and 146879 transitions. [2019-12-27 05:22:31,372 INFO L78 Accepts]: Start accepts. Automaton has 45311 states and 146879 transitions. Word has length 16 [2019-12-27 05:22:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:31,373 INFO L462 AbstractCegarLoop]: Abstraction has 45311 states and 146879 transitions. [2019-12-27 05:22:31,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:22:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 45311 states and 146879 transitions. [2019-12-27 05:22:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:22:31,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:31,385 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] [2019-12-27 05:22:31,386 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 572858118, now seen corresponding path program 1 times [2019-12-27 05:22:31,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:31,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146063488] [2019-12-27 05:22:31,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:31,490 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:22:31,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146063488] [2019-12-27 05:22:31,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:31,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:22:31,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099430821] [2019-12-27 05:22:31,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:22:31,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:22:31,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:22:31,492 INFO L87 Difference]: Start difference. First operand 45311 states and 146879 transitions. Second operand 7 states. [2019-12-27 05:22:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:32,711 INFO L93 Difference]: Finished difference Result 72804 states and 228787 transitions. [2019-12-27 05:22:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:22:32,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 05:22:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:32,837 INFO L225 Difference]: With dead ends: 72804 [2019-12-27 05:22:32,837 INFO L226 Difference]: Without dead ends: 72790 [2019-12-27 05:22:32,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:22:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72790 states. [2019-12-27 05:22:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72790 to 44975. [2019-12-27 05:22:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44975 states. [2019-12-27 05:22:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44975 states to 44975 states and 144930 transitions. [2019-12-27 05:22:34,391 INFO L78 Accepts]: Start accepts. Automaton has 44975 states and 144930 transitions. Word has length 22 [2019-12-27 05:22:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:34,392 INFO L462 AbstractCegarLoop]: Abstraction has 44975 states and 144930 transitions. [2019-12-27 05:22:34,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:22:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 44975 states and 144930 transitions. [2019-12-27 05:22:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:22:34,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:34,409 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:22:34,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -775936505, now seen corresponding path program 1 times [2019-12-27 05:22:34,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:34,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240680519] [2019-12-27 05:22:34,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:34,463 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:22:34,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240680519] [2019-12-27 05:22:34,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:34,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:34,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971130590] [2019-12-27 05:22:34,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:34,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:34,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:34,465 INFO L87 Difference]: Start difference. First operand 44975 states and 144930 transitions. Second operand 4 states. [2019-12-27 05:22:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:34,546 INFO L93 Difference]: Finished difference Result 18102 states and 54995 transitions. [2019-12-27 05:22:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:34,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:22:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:34,574 INFO L225 Difference]: With dead ends: 18102 [2019-12-27 05:22:34,574 INFO L226 Difference]: Without dead ends: 18102 [2019-12-27 05:22:34,574 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:22:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2019-12-27 05:22:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 17802. [2019-12-27 05:22:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2019-12-27 05:22:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 54181 transitions. [2019-12-27 05:22:34,858 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 54181 transitions. Word has length 25 [2019-12-27 05:22:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:34,858 INFO L462 AbstractCegarLoop]: Abstraction has 17802 states and 54181 transitions. [2019-12-27 05:22:34,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 54181 transitions. [2019-12-27 05:22:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:22:34,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:34,871 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:22:34,872 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:34,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1393972684, now seen corresponding path program 1 times [2019-12-27 05:22:34,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:34,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659359343] [2019-12-27 05:22:34,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:34,955 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:22:34,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659359343] [2019-12-27 05:22:34,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:34,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:22:34,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130089242] [2019-12-27 05:22:34,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:22:34,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:34,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:22:34,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:22:34,958 INFO L87 Difference]: Start difference. First operand 17802 states and 54181 transitions. Second operand 6 states. [2019-12-27 05:22:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:35,636 INFO L93 Difference]: Finished difference Result 25666 states and 75651 transitions. [2019-12-27 05:22:35,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:22:35,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:22:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:35,682 INFO L225 Difference]: With dead ends: 25666 [2019-12-27 05:22:35,682 INFO L226 Difference]: Without dead ends: 25666 [2019-12-27 05:22:35,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:22:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2019-12-27 05:22:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 20719. [2019-12-27 05:22:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2019-12-27 05:22:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 62283 transitions. [2019-12-27 05:22:36,195 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 62283 transitions. Word has length 27 [2019-12-27 05:22:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:36,195 INFO L462 AbstractCegarLoop]: Abstraction has 20719 states and 62283 transitions. [2019-12-27 05:22:36,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:22:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 62283 transitions. [2019-12-27 05:22:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:22:36,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:36,225 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] [2019-12-27 05:22:36,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1695040076, now seen corresponding path program 1 times [2019-12-27 05:22:36,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:36,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707897249] [2019-12-27 05:22:36,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:36,345 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:22:36,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707897249] [2019-12-27 05:22:36,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:36,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:36,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911649576] [2019-12-27 05:22:36,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:22:36,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:22:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:36,348 INFO L87 Difference]: Start difference. First operand 20719 states and 62283 transitions. Second operand 5 states. [2019-12-27 05:22:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:36,808 INFO L93 Difference]: Finished difference Result 25941 states and 77027 transitions. [2019-12-27 05:22:36,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:22:36,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 05:22:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:36,860 INFO L225 Difference]: With dead ends: 25941 [2019-12-27 05:22:36,860 INFO L226 Difference]: Without dead ends: 25941 [2019-12-27 05:22:36,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:22:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25941 states. [2019-12-27 05:22:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25941 to 21961. [2019-12-27 05:22:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-27 05:22:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 66303 transitions. [2019-12-27 05:22:37,504 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 66303 transitions. Word has length 33 [2019-12-27 05:22:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:37,504 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 66303 transitions. [2019-12-27 05:22:37,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:22:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 66303 transitions. [2019-12-27 05:22:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:22:37,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:37,532 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] [2019-12-27 05:22:37,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash 843232464, now seen corresponding path program 2 times [2019-12-27 05:22:37,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:37,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355494572] [2019-12-27 05:22:37,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:37,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355494572] [2019-12-27 05:22:37,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:37,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:22:37,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482500273] [2019-12-27 05:22:37,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:22:37,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:37,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:22:37,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:22:37,669 INFO L87 Difference]: Start difference. First operand 21961 states and 66303 transitions. Second operand 8 states. [2019-12-27 05:22:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:39,096 INFO L93 Difference]: Finished difference Result 29973 states and 87406 transitions. [2019-12-27 05:22:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:22:39,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:22:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:39,140 INFO L225 Difference]: With dead ends: 29973 [2019-12-27 05:22:39,140 INFO L226 Difference]: Without dead ends: 29973 [2019-12-27 05:22:39,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:22:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29973 states. [2019-12-27 05:22:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29973 to 18923. [2019-12-27 05:22:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18923 states. [2019-12-27 05:22:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18923 states to 18923 states and 56662 transitions. [2019-12-27 05:22:39,506 INFO L78 Accepts]: Start accepts. Automaton has 18923 states and 56662 transitions. Word has length 33 [2019-12-27 05:22:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:39,507 INFO L462 AbstractCegarLoop]: Abstraction has 18923 states and 56662 transitions. [2019-12-27 05:22:39,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:22:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18923 states and 56662 transitions. [2019-12-27 05:22:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:22:39,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:39,529 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] [2019-12-27 05:22:39,530 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash 353210315, now seen corresponding path program 1 times [2019-12-27 05:22:39,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:39,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916447494] [2019-12-27 05:22:39,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:39,592 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:22:39,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916447494] [2019-12-27 05:22:39,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:39,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:22:39,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114916525] [2019-12-27 05:22:39,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:39,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:39,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:39,594 INFO L87 Difference]: Start difference. First operand 18923 states and 56662 transitions. Second operand 3 states. [2019-12-27 05:22:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:39,663 INFO L93 Difference]: Finished difference Result 18922 states and 56660 transitions. [2019-12-27 05:22:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:39,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:22:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:39,689 INFO L225 Difference]: With dead ends: 18922 [2019-12-27 05:22:39,689 INFO L226 Difference]: Without dead ends: 18922 [2019-12-27 05:22:39,689 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:22:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18922 states. [2019-12-27 05:22:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18922 to 18922. [2019-12-27 05:22:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-27 05:22:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 56660 transitions. [2019-12-27 05:22:40,310 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 56660 transitions. Word has length 39 [2019-12-27 05:22:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:40,310 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 56660 transitions. [2019-12-27 05:22:40,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 56660 transitions. [2019-12-27 05:22:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:22:40,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:40,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:40,330 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1411726100, now seen corresponding path program 1 times [2019-12-27 05:22:40,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:40,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431162891] [2019-12-27 05:22:40,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:40,424 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:22:40,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431162891] [2019-12-27 05:22:40,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:40,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:40,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931283374] [2019-12-27 05:22:40,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:40,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:40,427 INFO L87 Difference]: Start difference. First operand 18922 states and 56660 transitions. Second operand 3 states. [2019-12-27 05:22:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:40,504 INFO L93 Difference]: Finished difference Result 17942 states and 53000 transitions. [2019-12-27 05:22:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:40,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:22:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:40,528 INFO L225 Difference]: With dead ends: 17942 [2019-12-27 05:22:40,529 INFO L226 Difference]: Without dead ends: 17942 [2019-12-27 05:22:40,529 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:22:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17942 states. [2019-12-27 05:22:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17942 to 17934. [2019-12-27 05:22:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17934 states. [2019-12-27 05:22:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17934 states to 17934 states and 52984 transitions. [2019-12-27 05:22:40,800 INFO L78 Accepts]: Start accepts. Automaton has 17934 states and 52984 transitions. Word has length 40 [2019-12-27 05:22:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:40,800 INFO L462 AbstractCegarLoop]: Abstraction has 17934 states and 52984 transitions. [2019-12-27 05:22:40,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17934 states and 52984 transitions. [2019-12-27 05:22:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:22:40,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:40,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:40,819 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:40,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1239521661, now seen corresponding path program 1 times [2019-12-27 05:22:40,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:40,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117142646] [2019-12-27 05:22:40,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:40,907 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:22:40,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117142646] [2019-12-27 05:22:40,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:40,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:40,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826019603] [2019-12-27 05:22:40,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:40,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:40,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:40,909 INFO L87 Difference]: Start difference. First operand 17934 states and 52984 transitions. Second operand 3 states. [2019-12-27 05:22:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:40,981 INFO L93 Difference]: Finished difference Result 17854 states and 52741 transitions. [2019-12-27 05:22:40,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:40,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 05:22:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:41,008 INFO L225 Difference]: With dead ends: 17854 [2019-12-27 05:22:41,008 INFO L226 Difference]: Without dead ends: 17854 [2019-12-27 05:22:41,008 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:22:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17854 states. [2019-12-27 05:22:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17854 to 15733. [2019-12-27 05:22:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15733 states. [2019-12-27 05:22:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15733 states to 15733 states and 47045 transitions. [2019-12-27 05:22:41,271 INFO L78 Accepts]: Start accepts. Automaton has 15733 states and 47045 transitions. Word has length 41 [2019-12-27 05:22:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:41,272 INFO L462 AbstractCegarLoop]: Abstraction has 15733 states and 47045 transitions. [2019-12-27 05:22:41,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15733 states and 47045 transitions. [2019-12-27 05:22:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 05:22:41,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:41,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:41,295 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:41,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1783448567, now seen corresponding path program 1 times [2019-12-27 05:22:41,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:41,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97863993] [2019-12-27 05:22:41,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:41,371 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:22:41,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97863993] [2019-12-27 05:22:41,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:41,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:22:41,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392784160] [2019-12-27 05:22:41,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:22:41,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:41,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:22:41,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:41,373 INFO L87 Difference]: Start difference. First operand 15733 states and 47045 transitions. Second operand 5 states. [2019-12-27 05:22:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:41,455 INFO L93 Difference]: Finished difference Result 14635 states and 44628 transitions. [2019-12-27 05:22:41,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:22:41,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 05:22:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:41,481 INFO L225 Difference]: With dead ends: 14635 [2019-12-27 05:22:41,481 INFO L226 Difference]: Without dead ends: 13655 [2019-12-27 05:22:41,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:22:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13655 states. [2019-12-27 05:22:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13655 to 13655. [2019-12-27 05:22:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13655 states. [2019-12-27 05:22:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 42042 transitions. [2019-12-27 05:22:41,729 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 42042 transitions. Word has length 42 [2019-12-27 05:22:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:41,729 INFO L462 AbstractCegarLoop]: Abstraction has 13655 states and 42042 transitions. [2019-12-27 05:22:41,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:22:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 42042 transitions. [2019-12-27 05:22:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:41,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:41,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:41,749 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash 789762333, now seen corresponding path program 1 times [2019-12-27 05:22:41,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:41,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823085869] [2019-12-27 05:22:41,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:41,801 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:22:41,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823085869] [2019-12-27 05:22:41,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:41,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:41,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210956618] [2019-12-27 05:22:41,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:41,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:41,803 INFO L87 Difference]: Start difference. First operand 13655 states and 42042 transitions. Second operand 3 states. [2019-12-27 05:22:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:41,909 INFO L93 Difference]: Finished difference Result 18557 states and 57523 transitions. [2019-12-27 05:22:41,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:41,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:22:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:41,933 INFO L225 Difference]: With dead ends: 18557 [2019-12-27 05:22:41,933 INFO L226 Difference]: Without dead ends: 18557 [2019-12-27 05:22:41,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18557 states. [2019-12-27 05:22:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18557 to 14853. [2019-12-27 05:22:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14853 states. [2019-12-27 05:22:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 46400 transitions. [2019-12-27 05:22:42,503 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 46400 transitions. Word has length 66 [2019-12-27 05:22:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:42,503 INFO L462 AbstractCegarLoop]: Abstraction has 14853 states and 46400 transitions. [2019-12-27 05:22:42,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 46400 transitions. [2019-12-27 05:22:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:42,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:42,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:42,519 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1778049442, now seen corresponding path program 1 times [2019-12-27 05:22:42,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:42,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313599979] [2019-12-27 05:22:42,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:42,659 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:22:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313599979] [2019-12-27 05:22:42,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:42,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:42,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017586670] [2019-12-27 05:22:42,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:22:42,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:42,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:22:42,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:42,662 INFO L87 Difference]: Start difference. First operand 14853 states and 46400 transitions. Second operand 9 states. [2019-12-27 05:22:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:44,539 INFO L93 Difference]: Finished difference Result 37514 states and 117559 transitions. [2019-12-27 05:22:44,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:22:44,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:22:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:44,593 INFO L225 Difference]: With dead ends: 37514 [2019-12-27 05:22:44,593 INFO L226 Difference]: Without dead ends: 26700 [2019-12-27 05:22:44,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:22:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26700 states. [2019-12-27 05:22:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26700 to 18392. [2019-12-27 05:22:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2019-12-27 05:22:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 57335 transitions. [2019-12-27 05:22:44,984 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 57335 transitions. Word has length 66 [2019-12-27 05:22:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:44,984 INFO L462 AbstractCegarLoop]: Abstraction has 18392 states and 57335 transitions. [2019-12-27 05:22:44,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 57335 transitions. [2019-12-27 05:22:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:45,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:45,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:45,003 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash -415442966, now seen corresponding path program 2 times [2019-12-27 05:22:45,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:45,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262512544] [2019-12-27 05:22:45,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:45,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262512544] [2019-12-27 05:22:45,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:45,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:45,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185557819] [2019-12-27 05:22:45,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:45,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:45,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:45,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:45,088 INFO L87 Difference]: Start difference. First operand 18392 states and 57335 transitions. Second operand 3 states. [2019-12-27 05:22:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:45,250 INFO L93 Difference]: Finished difference Result 21781 states and 67544 transitions. [2019-12-27 05:22:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:45,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:22:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:45,291 INFO L225 Difference]: With dead ends: 21781 [2019-12-27 05:22:45,291 INFO L226 Difference]: Without dead ends: 21781 [2019-12-27 05:22:45,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21781 states. [2019-12-27 05:22:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21781 to 18926. [2019-12-27 05:22:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18926 states. [2019-12-27 05:22:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18926 states to 18926 states and 59112 transitions. [2019-12-27 05:22:45,826 INFO L78 Accepts]: Start accepts. Automaton has 18926 states and 59112 transitions. Word has length 66 [2019-12-27 05:22:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:45,826 INFO L462 AbstractCegarLoop]: Abstraction has 18926 states and 59112 transitions. [2019-12-27 05:22:45,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18926 states and 59112 transitions. [2019-12-27 05:22:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:45,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:45,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:45,857 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1124059975, now seen corresponding path program 1 times [2019-12-27 05:22:45,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:45,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034243121] [2019-12-27 05:22:45,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:45,929 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:22:45,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034243121] [2019-12-27 05:22:45,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:45,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:45,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890785007] [2019-12-27 05:22:45,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:45,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:45,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:45,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:45,932 INFO L87 Difference]: Start difference. First operand 18926 states and 59112 transitions. Second operand 3 states. [2019-12-27 05:22:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:46,169 INFO L93 Difference]: Finished difference Result 27366 states and 85370 transitions. [2019-12-27 05:22:46,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:46,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 05:22:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:46,222 INFO L225 Difference]: With dead ends: 27366 [2019-12-27 05:22:46,222 INFO L226 Difference]: Without dead ends: 27366 [2019-12-27 05:22:46,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27366 states. [2019-12-27 05:22:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27366 to 19344. [2019-12-27 05:22:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19344 states. [2019-12-27 05:22:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19344 states to 19344 states and 60427 transitions. [2019-12-27 05:22:47,028 INFO L78 Accepts]: Start accepts. Automaton has 19344 states and 60427 transitions. Word has length 67 [2019-12-27 05:22:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:47,029 INFO L462 AbstractCegarLoop]: Abstraction has 19344 states and 60427 transitions. [2019-12-27 05:22:47,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 19344 states and 60427 transitions. [2019-12-27 05:22:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:47,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:47,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:47,049 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1111850191, now seen corresponding path program 2 times [2019-12-27 05:22:47,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:47,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382106836] [2019-12-27 05:22:47,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:22:47,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382106836] [2019-12-27 05:22:47,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:47,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:47,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488259051] [2019-12-27 05:22:47,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:47,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:47,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:47,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:47,135 INFO L87 Difference]: Start difference. First operand 19344 states and 60427 transitions. Second operand 4 states. [2019-12-27 05:22:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:47,291 INFO L93 Difference]: Finished difference Result 19344 states and 60245 transitions. [2019-12-27 05:22:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:47,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 05:22:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:47,323 INFO L225 Difference]: With dead ends: 19344 [2019-12-27 05:22:47,324 INFO L226 Difference]: Without dead ends: 19344 [2019-12-27 05:22:47,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:22:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19344 states. [2019-12-27 05:22:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19344 to 17362. [2019-12-27 05:22:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17362 states. [2019-12-27 05:22:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17362 states to 17362 states and 54134 transitions. [2019-12-27 05:22:47,630 INFO L78 Accepts]: Start accepts. Automaton has 17362 states and 54134 transitions. Word has length 67 [2019-12-27 05:22:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:47,630 INFO L462 AbstractCegarLoop]: Abstraction has 17362 states and 54134 transitions. [2019-12-27 05:22:47,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17362 states and 54134 transitions. [2019-12-27 05:22:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:47,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:47,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:47,650 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1228876713, now seen corresponding path program 1 times [2019-12-27 05:22:47,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:47,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075688984] [2019-12-27 05:22:47,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:47,985 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:22:47,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075688984] [2019-12-27 05:22:47,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:47,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:22:47,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090482193] [2019-12-27 05:22:47,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:22:47,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:22:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:22:47,987 INFO L87 Difference]: Start difference. First operand 17362 states and 54134 transitions. Second operand 11 states. [2019-12-27 05:22:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:49,197 INFO L93 Difference]: Finished difference Result 21799 states and 67404 transitions. [2019-12-27 05:22:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:22:49,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:22:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:49,226 INFO L225 Difference]: With dead ends: 21799 [2019-12-27 05:22:49,226 INFO L226 Difference]: Without dead ends: 20276 [2019-12-27 05:22:49,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:22:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20276 states. [2019-12-27 05:22:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20276 to 17730. [2019-12-27 05:22:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17730 states. [2019-12-27 05:22:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17730 states to 17730 states and 55202 transitions. [2019-12-27 05:22:49,533 INFO L78 Accepts]: Start accepts. Automaton has 17730 states and 55202 transitions. Word has length 67 [2019-12-27 05:22:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:49,533 INFO L462 AbstractCegarLoop]: Abstraction has 17730 states and 55202 transitions. [2019-12-27 05:22:49,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:22:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17730 states and 55202 transitions. [2019-12-27 05:22:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:49,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:49,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:49,553 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2010045911, now seen corresponding path program 2 times [2019-12-27 05:22:49,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:49,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730536032] [2019-12-27 05:22:49,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:49,726 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:22:49,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730536032] [2019-12-27 05:22:49,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:49,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:49,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990285112] [2019-12-27 05:22:49,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:22:49,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:22:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:22:49,729 INFO L87 Difference]: Start difference. First operand 17730 states and 55202 transitions. Second operand 10 states. [2019-12-27 05:22:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:51,704 INFO L93 Difference]: Finished difference Result 26349 states and 81396 transitions. [2019-12-27 05:22:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:22:51,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:22:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:51,742 INFO L225 Difference]: With dead ends: 26349 [2019-12-27 05:22:51,742 INFO L226 Difference]: Without dead ends: 23446 [2019-12-27 05:22:51,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:22:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23446 states. [2019-12-27 05:22:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23446 to 17957. [2019-12-27 05:22:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17957 states. [2019-12-27 05:22:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17957 states to 17957 states and 55897 transitions. [2019-12-27 05:22:52,070 INFO L78 Accepts]: Start accepts. Automaton has 17957 states and 55897 transitions. Word has length 67 [2019-12-27 05:22:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:52,070 INFO L462 AbstractCegarLoop]: Abstraction has 17957 states and 55897 transitions. [2019-12-27 05:22:52,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:22:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17957 states and 55897 transitions. [2019-12-27 05:22:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:52,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:52,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:52,090 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -163030355, now seen corresponding path program 3 times [2019-12-27 05:22:52,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:52,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600728449] [2019-12-27 05:22:52,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:52,309 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:22:52,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600728449] [2019-12-27 05:22:52,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:52,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:22:52,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317240617] [2019-12-27 05:22:52,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:22:52,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:22:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:22:52,312 INFO L87 Difference]: Start difference. First operand 17957 states and 55897 transitions. Second operand 12 states. [2019-12-27 05:22:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:54,369 INFO L93 Difference]: Finished difference Result 24165 states and 74988 transitions. [2019-12-27 05:22:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:22:54,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:22:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:54,402 INFO L225 Difference]: With dead ends: 24165 [2019-12-27 05:22:54,403 INFO L226 Difference]: Without dead ends: 22322 [2019-12-27 05:22:54,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:22:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22322 states. [2019-12-27 05:22:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22322 to 18233. [2019-12-27 05:22:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18233 states. [2019-12-27 05:22:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18233 states to 18233 states and 56683 transitions. [2019-12-27 05:22:54,736 INFO L78 Accepts]: Start accepts. Automaton has 18233 states and 56683 transitions. Word has length 67 [2019-12-27 05:22:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:54,736 INFO L462 AbstractCegarLoop]: Abstraction has 18233 states and 56683 transitions. [2019-12-27 05:22:54,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:22:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 18233 states and 56683 transitions. [2019-12-27 05:22:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:54,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:54,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:54,757 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash 713576877, now seen corresponding path program 4 times [2019-12-27 05:22:54,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:54,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819165939] [2019-12-27 05:22:54,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:54,978 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:22:54,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819165939] [2019-12-27 05:22:54,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:54,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:22:54,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149888984] [2019-12-27 05:22:54,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 05:22:54,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 05:22:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:22:54,980 INFO L87 Difference]: Start difference. First operand 18233 states and 56683 transitions. Second operand 13 states. [2019-12-27 05:22:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:57,271 INFO L93 Difference]: Finished difference Result 24293 states and 74845 transitions. [2019-12-27 05:22:57,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:22:57,272 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 05:22:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:57,306 INFO L225 Difference]: With dead ends: 24293 [2019-12-27 05:22:57,306 INFO L226 Difference]: Without dead ends: 23342 [2019-12-27 05:22:57,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:22:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23342 states. [2019-12-27 05:22:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23342 to 17701. [2019-12-27 05:22:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17701 states. [2019-12-27 05:22:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17701 states to 17701 states and 55063 transitions. [2019-12-27 05:22:57,632 INFO L78 Accepts]: Start accepts. Automaton has 17701 states and 55063 transitions. Word has length 67 [2019-12-27 05:22:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:57,632 INFO L462 AbstractCegarLoop]: Abstraction has 17701 states and 55063 transitions. [2019-12-27 05:22:57,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 05:22:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17701 states and 55063 transitions. [2019-12-27 05:22:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:57,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:57,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:57,652 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash -998115875, now seen corresponding path program 5 times [2019-12-27 05:22:57,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:57,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65153447] [2019-12-27 05:22:57,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:57,899 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:22:57,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65153447] [2019-12-27 05:22:57,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:57,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:22:57,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421749887] [2019-12-27 05:22:57,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:22:57,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:22:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:22:57,901 INFO L87 Difference]: Start difference. First operand 17701 states and 55063 transitions. Second operand 11 states. [2019-12-27 05:22:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:59,537 INFO L93 Difference]: Finished difference Result 41805 states and 128953 transitions. [2019-12-27 05:22:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 05:22:59,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:22:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:59,579 INFO L225 Difference]: With dead ends: 41805 [2019-12-27 05:22:59,579 INFO L226 Difference]: Without dead ends: 30282 [2019-12-27 05:22:59,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 05:22:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30282 states. [2019-12-27 05:22:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30282 to 17126. [2019-12-27 05:22:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-12-27 05:22:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 53177 transitions. [2019-12-27 05:22:59,944 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 53177 transitions. Word has length 67 [2019-12-27 05:22:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:59,944 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 53177 transitions. [2019-12-27 05:22:59,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:22:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 53177 transitions. [2019-12-27 05:22:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:59,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:59,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:22:59,965 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash 869682389, now seen corresponding path program 6 times [2019-12-27 05:22:59,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:59,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005292279] [2019-12-27 05:22:59,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:00,167 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:00,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005292279] [2019-12-27 05:23:00,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:23:00,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690654227] [2019-12-27 05:23:00,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:23:00,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:23:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:23:00,169 INFO L87 Difference]: Start difference. First operand 17126 states and 53177 transitions. Second operand 12 states. [2019-12-27 05:23:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:01,619 INFO L93 Difference]: Finished difference Result 20890 states and 64511 transitions. [2019-12-27 05:23:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:23:01,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 05:23:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:01,649 INFO L225 Difference]: With dead ends: 20890 [2019-12-27 05:23:01,650 INFO L226 Difference]: Without dead ends: 20675 [2019-12-27 05:23:01,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:23:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20675 states. [2019-12-27 05:23:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20675 to 17030. [2019-12-27 05:23:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17030 states. [2019-12-27 05:23:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17030 states to 17030 states and 52913 transitions. [2019-12-27 05:23:02,179 INFO L78 Accepts]: Start accepts. Automaton has 17030 states and 52913 transitions. Word has length 67 [2019-12-27 05:23:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:02,179 INFO L462 AbstractCegarLoop]: Abstraction has 17030 states and 52913 transitions. [2019-12-27 05:23:02,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:23:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17030 states and 52913 transitions. [2019-12-27 05:23:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:23:02,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:02,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:02,197 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1815001603, now seen corresponding path program 7 times [2019-12-27 05:23:02,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:02,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254052621] [2019-12-27 05:23:02,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:23:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:23:02,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:23:02,321 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:23:02,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t275~0.base_25|) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= |v_ULTIMATE.start_main_~#t275~0.offset_19| 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~a$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~a$r_buff0_thd3~0_77 0) (= v_~x~0_10 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t275~0.base_25| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t275~0.base_25|)) (= v_~a$r_buff0_thd1~0_27 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t275~0.base_25| 1)) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t275~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t275~0.base_25|) |v_ULTIMATE.start_main_~#t275~0.offset_19| 0))) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~a$w_buff1~0_26) (= v_~a$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~y~0_8) (= 0 v_~a$r_buff1_thd0~0_22) (= v_~a$r_buff0_thd2~0_21 0) (= |v_#NULL.offset_4| 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= 0 v_~z~0_8) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~a$r_buff1_thd1~0_17) (= v_~main$tmp_guard0~0_11 0) (= v_~a$r_buff0_thd0~0_21 0) (= v_~a~0_27 0) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t276~0.base=|v_ULTIMATE.start_main_~#t276~0.base_21|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ULTIMATE.start_main_~#t276~0.offset=|v_ULTIMATE.start_main_~#t276~0.offset_17|, ULTIMATE.start_main_~#t275~0.offset=|v_ULTIMATE.start_main_~#t275~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t277~0.base=|v_ULTIMATE.start_main_~#t277~0.base_21|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_26, ULTIMATE.start_main_~#t277~0.offset=|v_ULTIMATE.start_main_~#t277~0.offset_17|, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t275~0.base=|v_ULTIMATE.start_main_~#t275~0.base_25|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t276~0.base, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t276~0.offset, ULTIMATE.start_main_~#t275~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t277~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t277~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t275~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 05:23:02,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= v_~a$w_buff0_used~0_92 1) (= 0 (mod v_~a$w_buff1_used~0_57 256)) (= v_~a$w_buff0_used~0_93 v_~a$w_buff1_used~0_57) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_16 v_~a$w_buff1~0_18) (= 1 v_~a$w_buff0~0_15) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_15, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:23:02,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t276~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t276~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t276~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t276~0.base_12|) |v_ULTIMATE.start_main_~#t276~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t276~0.base_12| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t276~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t276~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t276~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t276~0.base=|v_ULTIMATE.start_main_~#t276~0.base_12|, ULTIMATE.start_main_~#t276~0.offset=|v_ULTIMATE.start_main_~#t276~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t276~0.base, ULTIMATE.start_main_~#t276~0.offset] because there is no mapped edge [2019-12-27 05:23:02,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t277~0.base_12| 4)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t277~0.base_12| 1) |v_#valid_32|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t277~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t277~0.base_12|) |v_ULTIMATE.start_main_~#t277~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t277~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t277~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t277~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t277~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t277~0.base=|v_ULTIMATE.start_main_~#t277~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t277~0.offset=|v_ULTIMATE.start_main_~#t277~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t277~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t277~0.offset] because there is no mapped edge [2019-12-27 05:23:02,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In841336106 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In841336106 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out841336106| ~a~0_In841336106)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out841336106| ~a$w_buff1~0_In841336106)))) InVars {~a~0=~a~0_In841336106, ~a$w_buff1~0=~a$w_buff1~0_In841336106, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In841336106, ~a$w_buff1_used~0=~a$w_buff1_used~0_In841336106} OutVars{~a~0=~a~0_In841336106, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out841336106|, ~a$w_buff1~0=~a$w_buff1~0_In841336106, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In841336106, ~a$w_buff1_used~0=~a$w_buff1_used~0_In841336106} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:23:02,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:23:02,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1389861309 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1389861309 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1389861309|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1389861309| ~a$w_buff0_used~0_In1389861309)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1389861309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1389861309} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1389861309, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1389861309, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1389861309|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:23:02,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In994838037 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In994838037 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out994838037| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out994838037| ~a$w_buff0_used~0_In994838037)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In994838037, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In994838037} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out994838037|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In994838037, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In994838037} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:23:02,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1489419480 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1489419480 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1489419480 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1489419480 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1489419480|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1489419480| ~a$w_buff1_used~0_In-1489419480) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1489419480, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1489419480, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1489419480, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1489419480} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1489419480|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1489419480, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1489419480, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1489419480, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1489419480} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:23:02,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In142155837 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In142155837 256)))) (or (and (= ~a$r_buff0_thd1~0_In142155837 ~a$r_buff0_thd1~0_Out142155837) (or .cse0 .cse1)) (and (= 0 ~a$r_buff0_thd1~0_Out142155837) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In142155837, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In142155837} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out142155837|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In142155837, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out142155837} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:23:02,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1532647645 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1532647645 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1532647645 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1532647645 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1532647645| ~a$r_buff1_thd1~0_In1532647645)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1532647645| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1532647645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1532647645, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1532647645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1532647645} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1532647645|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1532647645, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1532647645, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1532647645, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1532647645} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:23:02,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L756-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:23:02,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In339800941 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In339800941| |P2Thread1of1ForFork0_#t~ite20_Out339800941|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out339800941| ~a$w_buff0~0_In339800941)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In339800941 256) 0))) (or (= (mod ~a$w_buff0_used~0_In339800941 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In339800941 256) 0) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In339800941 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out339800941| ~a$w_buff0~0_In339800941) (= |P2Thread1of1ForFork0_#t~ite21_Out339800941| |P2Thread1of1ForFork0_#t~ite20_Out339800941|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In339800941, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In339800941, ~a$w_buff0_used~0=~a$w_buff0_used~0_In339800941, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In339800941, ~a$w_buff1_used~0=~a$w_buff1_used~0_In339800941, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In339800941|, ~weak$$choice2~0=~weak$$choice2~0_In339800941} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out339800941|, ~a$w_buff0~0=~a$w_buff0~0_In339800941, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In339800941, ~a$w_buff0_used~0=~a$w_buff0_used~0_In339800941, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In339800941, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out339800941|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In339800941, ~weak$$choice2~0=~weak$$choice2~0_In339800941} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:23:02,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1053778214 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In1053778214| |P2Thread1of1ForFork0_#t~ite26_Out1053778214|) (= |P2Thread1of1ForFork0_#t~ite27_Out1053778214| ~a$w_buff0_used~0_In1053778214) (not .cse0)) (and (= ~a$w_buff0_used~0_In1053778214 |P2Thread1of1ForFork0_#t~ite26_Out1053778214|) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out1053778214| |P2Thread1of1ForFork0_#t~ite26_Out1053778214|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1053778214 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In1053778214 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In1053778214 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1053778214 256))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1053778214|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1053778214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1053778214, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1053778214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1053778214, ~weak$$choice2~0=~weak$$choice2~0_In1053778214} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1053778214|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1053778214|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1053778214, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1053778214, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1053778214, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1053778214, ~weak$$choice2~0=~weak$$choice2~0_In1053778214} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:23:02,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_47 v_~a$r_buff0_thd3~0_46)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_46, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:23:02,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (= v_~a~0_17 v_~a$mem_tmp~0_4) (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_17, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:23:02,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-509713029 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-509713029 256) 0)) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-509713029| |P2Thread1of1ForFork0_#t~ite38_Out-509713029|))) (or (and .cse0 (or .cse1 .cse2) (= ~a~0_In-509713029 |P2Thread1of1ForFork0_#t~ite38_Out-509713029|)) (and (not .cse2) (not .cse1) .cse0 (= ~a$w_buff1~0_In-509713029 |P2Thread1of1ForFork0_#t~ite38_Out-509713029|)))) InVars {~a~0=~a~0_In-509713029, ~a$w_buff1~0=~a$w_buff1~0_In-509713029, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-509713029, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-509713029} OutVars{~a~0=~a~0_In-509713029, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-509713029|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-509713029|, ~a$w_buff1~0=~a$w_buff1~0_In-509713029, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-509713029, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-509713029} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:23:02,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-518063900 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-518063900 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-518063900| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-518063900| ~a$w_buff0_used~0_In-518063900)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-518063900, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-518063900} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-518063900|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-518063900, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-518063900} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:23:02,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1874476456 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1874476456 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1874476456 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In1874476456 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1874476456|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1874476456 |P2Thread1of1ForFork0_#t~ite41_Out1874476456|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1874476456, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1874476456, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1874476456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1874476456} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1874476456, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1874476456, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1874476456, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1874476456, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1874476456|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:23:02,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In971944931 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In971944931 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In971944931 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In971944931 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out971944931| ~a$w_buff1_used~0_In971944931) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out971944931| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In971944931, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In971944931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971944931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971944931} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In971944931, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In971944931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971944931, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out971944931|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971944931} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:23:02,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1905867204 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1905867204 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1905867204|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1905867204 |P1Thread1of1ForFork2_#t~ite13_Out1905867204|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1905867204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1905867204} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1905867204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1905867204, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1905867204|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:23:02,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1877744039 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1877744039 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1877744039 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1877744039 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1877744039| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1877744039| ~a$r_buff1_thd2~0_In-1877744039) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1877744039, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1877744039, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1877744039, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1877744039} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1877744039, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1877744039, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1877744039, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1877744039, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1877744039|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:23:02,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:23:02,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In2045332541 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2045332541 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out2045332541| ~a$r_buff0_thd3~0_In2045332541) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out2045332541| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2045332541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2045332541} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2045332541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2045332541, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out2045332541|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:23:02,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In40852827 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In40852827 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In40852827 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In40852827 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In40852827 |P2Thread1of1ForFork0_#t~ite43_Out40852827|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out40852827|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In40852827, ~a$w_buff0_used~0=~a$w_buff0_used~0_In40852827, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In40852827, ~a$w_buff1_used~0=~a$w_buff1_used~0_In40852827} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out40852827|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In40852827, ~a$w_buff0_used~0=~a$w_buff0_used~0_In40852827, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In40852827, ~a$w_buff1_used~0=~a$w_buff1_used~0_In40852827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:23:02,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_45 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:23:02,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:23:02,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In927579973 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In927579973 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out927579973| ~a$w_buff1~0_In927579973) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out927579973| ~a~0_In927579973) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In927579973, ~a$w_buff1~0=~a$w_buff1~0_In927579973, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In927579973, ~a$w_buff1_used~0=~a$w_buff1_used~0_In927579973} OutVars{~a~0=~a~0_In927579973, ~a$w_buff1~0=~a$w_buff1~0_In927579973, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out927579973|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In927579973, ~a$w_buff1_used~0=~a$w_buff1_used~0_In927579973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:23:02,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_19 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:23:02,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-687518956 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-687518956 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-687518956|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-687518956 |ULTIMATE.start_main_#t~ite49_Out-687518956|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-687518956, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-687518956} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-687518956, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-687518956|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-687518956} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:23:02,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In673050029 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In673050029 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In673050029 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In673050029 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In673050029 |ULTIMATE.start_main_#t~ite50_Out673050029|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out673050029|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In673050029, ~a$w_buff0_used~0=~a$w_buff0_used~0_In673050029, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In673050029, ~a$w_buff1_used~0=~a$w_buff1_used~0_In673050029} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out673050029|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In673050029, ~a$w_buff0_used~0=~a$w_buff0_used~0_In673050029, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In673050029, ~a$w_buff1_used~0=~a$w_buff1_used~0_In673050029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:23:02,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-211930288 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-211930288 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-211930288| 0) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-211930288 |ULTIMATE.start_main_#t~ite51_Out-211930288|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-211930288, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-211930288} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-211930288|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-211930288, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-211930288} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:23:02,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In-775138204 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-775138204 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-775138204 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-775138204 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-775138204 |ULTIMATE.start_main_#t~ite52_Out-775138204|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-775138204|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-775138204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-775138204, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-775138204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-775138204} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-775138204|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-775138204, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-775138204, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-775138204, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-775138204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:23:02,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_14) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_7 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:23:02,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:23:02 BasicIcfg [2019-12-27 05:23:02,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:23:02,448 INFO L168 Benchmark]: Toolchain (without parser) took 109402.00 ms. Allocated memory was 143.1 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,449 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.84 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.2 MB in the beginning and 150.6 MB in the end (delta: -51.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.84 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,450 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 ms. Allocated memory is still 199.8 MB. Free memory was 148.5 MB in the beginning and 145.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,451 INFO L168 Benchmark]: RCFGBuilder took 867.38 ms. Allocated memory is still 199.8 MB. Free memory was 145.6 MB in the beginning and 94.9 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,451 INFO L168 Benchmark]: TraceAbstraction took 107630.74 ms. Allocated memory was 199.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 05:23:02,454 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.73 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.84 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.2 MB in the beginning and 150.6 MB in the end (delta: -51.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.84 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.16 ms. Allocated memory is still 199.8 MB. Free memory was 148.5 MB in the beginning and 145.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.38 ms. Allocated memory is still 199.8 MB. Free memory was 145.6 MB in the beginning and 94.9 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107630.74 ms. Allocated memory was 199.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 179 ProgramPointsBefore, 97 ProgramPointsAfterwards, 216 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 30 ChoiceCompositions, 6465 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 95714 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t275, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t276, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t277, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=7, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5202 SDtfs, 5984 SDslu, 19396 SDs, 0 SdLazy, 13381 SolverSat, 311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 29 SyntacticMatches, 17 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184385occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 133245 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1146 NumberOfCodeBlocks, 1146 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1055 ConstructedInterpolants, 0 QuantifiedInterpolants, 242639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...