/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:17:13,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:17:13,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:17:13,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:17:13,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:17:13,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:17:13,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:17:13,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:17:13,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:17:13,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:17:13,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:17:13,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:17:13,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:17:13,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:17:13,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:17:13,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:17:13,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:17:13,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:17:13,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:17:13,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:17:13,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:17:13,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:17:13,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:17:13,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:17:13,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:17:13,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:17:13,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:17:13,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:17:13,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:17:13,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:17:13,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:17:13,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:17:13,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:17:13,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:17:13,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:17:13,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:17:13,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:17:13,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:17:13,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:17:13,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:17:13,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:17:13,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:17:13,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:17:13,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:17:13,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:17:13,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:17:13,796 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:17:13,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:17:13,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:17:13,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:17:13,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:17:13,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:17:13,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:17:13,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:17:13,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:17:13,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:17:13,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:17:13,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:17:13,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:17:13,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:17:13,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:17:13,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:17:13,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:17:13,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:17:13,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:17:13,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:17:13,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:17:13,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:17:13,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:17:13,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:17:13,801 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:17:13,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:17:14,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:17:14,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:17:14,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:17:14,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:17:14,098 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:17:14,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-26 21:17:14,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6093895d0/1edd0008ca1140c19a6173c8d535bb60/FLAGea70cd286 [2019-12-26 21:17:14,795 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:17:14,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-26 21:17:14,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6093895d0/1edd0008ca1140c19a6173c8d535bb60/FLAGea70cd286 [2019-12-26 21:17:15,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6093895d0/1edd0008ca1140c19a6173c8d535bb60 [2019-12-26 21:17:15,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:17:15,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:17:15,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:17:15,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:17:15,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:17:15,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15, skipping insertion in model container [2019-12-26 21:17:15,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:17:15,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:17:15,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:17:15,699 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:17:15,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:17:15,860 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:17:15,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15 WrapperNode [2019-12-26 21:17:15,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:17:15,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:17:15,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:17:15,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:17:15,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:17:15,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:17:15,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:17:15,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:17:15,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (1/1) ... [2019-12-26 21:17:15,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:17:15,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:17:15,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:17:15,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:17:15,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (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-26 21:17:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:17:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:17:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:17:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:17:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:17:16,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:17:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:17:16,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:17:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:17:16,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:17:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:17:16,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:17:16,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:17:16,077 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:17:16,949 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:17:16,949 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:17:16,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:17:16 BoogieIcfgContainer [2019-12-26 21:17:16,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:17:16,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:17:16,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:17:16,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:17:16,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:17:15" (1/3) ... [2019-12-26 21:17:16,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5b6480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:17:16, skipping insertion in model container [2019-12-26 21:17:16,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:17:15" (2/3) ... [2019-12-26 21:17:16,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5b6480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:17:16, skipping insertion in model container [2019-12-26 21:17:16,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:17:16" (3/3) ... [2019-12-26 21:17:16,962 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-26 21:17:16,973 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:17:16,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:17:16,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:17:16,986 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:17:17,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,112 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,112 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,176 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:17:17,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:17:17,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:17:17,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:17:17,226 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:17:17,226 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:17:17,226 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:17:17,226 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:17:17,226 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:17:17,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:17:17,251 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 21:17:17,253 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 21:17:17,408 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 21:17:17,408 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:17:17,434 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:17:17,464 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 21:17:17,557 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 21:17:17,557 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:17:17,565 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:17:17,588 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:17:17,589 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:17:22,974 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 21:17:23,113 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 21:17:23,144 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-26 21:17:23,144 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-26 21:17:23,148 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-26 21:17:40,433 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-26 21:17:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-26 21:17:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:17:40,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:17:40,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:17:40,443 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-26 21:17:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:17:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-26 21:17:40,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:17:40,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057291422] [2019-12-26 21:17:40,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:17:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:17:40,703 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-26 21:17:40,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057291422] [2019-12-26 21:17:40,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:17:40,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:17:40,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207277943] [2019-12-26 21:17:40,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:17:40,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:17:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:17:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:17:40,730 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-26 21:17:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:17:42,306 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-26 21:17:42,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:17:42,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:17:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:17:43,014 INFO L225 Difference]: With dead ends: 109312 [2019-12-26 21:17:43,014 INFO L226 Difference]: Without dead ends: 102592 [2019-12-26 21:17:43,016 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-26 21:17:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-26 21:17:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-26 21:17:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-26 21:17:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-26 21:17:54,722 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-26 21:17:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:17:54,722 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-26 21:17:54,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:17:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-26 21:17:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:17:54,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:17:54,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:17:54,726 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-26 21:17:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:17:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-26 21:17:54,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:17:54,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211679990] [2019-12-26 21:17:54,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:17:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:17:54,844 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-26 21:17:54,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211679990] [2019-12-26 21:17:54,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:17:54,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:17:54,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016951522] [2019-12-26 21:17:54,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:17:54,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:17:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:17:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:17:54,847 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-26 21:18:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:00,573 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-26 21:18:00,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:00,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:18:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:01,412 INFO L225 Difference]: With dead ends: 159508 [2019-12-26 21:18:01,412 INFO L226 Difference]: Without dead ends: 159459 [2019-12-26 21:18:01,413 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-26 21:18:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-26 21:18:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-26 21:18:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-26 21:18:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-26 21:18:15,254 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-26 21:18:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:15,254 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-26 21:18:15,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-26 21:18:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:18:15,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:15,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:15,262 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-26 21:18:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-26 21:18:15,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:15,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837558162] [2019-12-26 21:18:15,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:15,318 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-26 21:18:15,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837558162] [2019-12-26 21:18:15,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:15,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:15,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620322638] [2019-12-26 21:18:15,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:15,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:15,320 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-26 21:18:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:15,436 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-26 21:18:15,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:15,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:18:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:15,506 INFO L225 Difference]: With dead ends: 32284 [2019-12-26 21:18:15,506 INFO L226 Difference]: Without dead ends: 32284 [2019-12-26 21:18:15,507 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-26 21:18:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-26 21:18:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-26 21:18:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-26 21:18:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-26 21:18:16,218 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-26 21:18:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-26 21:18:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-26 21:18:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:18:16,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:16,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:16,222 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-26 21:18:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:16,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-26 21:18:16,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:16,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523894223] [2019-12-26 21:18:16,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:16,327 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-26 21:18:16,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523894223] [2019-12-26 21:18:16,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:16,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:16,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760336544] [2019-12-26 21:18:16,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:18:16,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:18:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:16,329 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-26 21:18:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:16,712 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-26 21:18:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:16,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:18:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:16,783 INFO L225 Difference]: With dead ends: 40215 [2019-12-26 21:18:16,783 INFO L226 Difference]: Without dead ends: 40215 [2019-12-26 21:18:16,784 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-26 21:18:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-26 21:18:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-26 21:18:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-26 21:18:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-26 21:18:18,604 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-26 21:18:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:18,605 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-26 21:18:18,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-26 21:18:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:18:18,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:18,613 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-26 21:18:18,613 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-26 21:18:18,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-26 21:18:18,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:18,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742026569] [2019-12-26 21:18:18,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:18,756 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-26 21:18:18,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742026569] [2019-12-26 21:18:18,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:18,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:18:18,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265803620] [2019-12-26 21:18:18,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:18:18,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:18,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:18:18,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:18:18,761 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-26 21:18:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:19,380 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-26 21:18:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:18:19,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:18:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:19,448 INFO L225 Difference]: With dead ends: 46566 [2019-12-26 21:18:19,448 INFO L226 Difference]: Without dead ends: 46559 [2019-12-26 21:18:19,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:18:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-26 21:18:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-26 21:18:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-26 21:18:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-26 21:18:20,114 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-26 21:18:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:20,115 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-26 21:18:20,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:18:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-26 21:18:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:18:20,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:20,127 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-26 21:18:20,127 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-26 21:18:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-26 21:18:20,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:20,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754258] [2019-12-26 21:18:20,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:20,187 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-26 21:18:20,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754258] [2019-12-26 21:18:20,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:20,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:18:20,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796716555] [2019-12-26 21:18:20,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:18:20,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:18:20,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:18:20,190 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-26 21:18:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:20,261 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-26 21:18:20,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:18:20,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:18:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:20,287 INFO L225 Difference]: With dead ends: 14498 [2019-12-26 21:18:20,287 INFO L226 Difference]: Without dead ends: 14498 [2019-12-26 21:18:20,287 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-26 21:18:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-26 21:18:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-26 21:18:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-26 21:18:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-26 21:18:20,499 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-26 21:18:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:20,500 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-26 21:18:20,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:18:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-26 21:18:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:18:20,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:20,510 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-26 21:18:20,510 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-26 21:18:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-26 21:18:20,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:20,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032266104] [2019-12-26 21:18:20,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:20,627 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-26 21:18:20,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032266104] [2019-12-26 21:18:20,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:20,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:18:20,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471640706] [2019-12-26 21:18:20,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:18:20,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:18:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:18:20,629 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-26 21:18:21,443 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-26 21:18:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:21,851 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-26 21:18:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:18:21,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:18:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:21,906 INFO L225 Difference]: With dead ends: 39008 [2019-12-26 21:18:21,906 INFO L226 Difference]: Without dead ends: 39008 [2019-12-26 21:18:21,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:18:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-26 21:18:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-26 21:18:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-26 21:18:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-26 21:18:22,351 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-26 21:18:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:22,351 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-26 21:18:22,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:18:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-26 21:18:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:18:22,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:22,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:18:22,368 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-26 21:18:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-26 21:18:22,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:22,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586079472] [2019-12-26 21:18:22,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:22,460 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-26 21:18:22,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586079472] [2019-12-26 21:18:22,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:22,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:18:22,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759954812] [2019-12-26 21:18:22,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:18:22,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:22,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:18:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:18:22,462 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-26 21:18:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:23,200 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-26 21:18:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:18:23,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 21:18:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:23,267 INFO L225 Difference]: With dead ends: 43584 [2019-12-26 21:18:23,267 INFO L226 Difference]: Without dead ends: 43584 [2019-12-26 21:18:23,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:18:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-26 21:18:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-26 21:18:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-26 21:18:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-26 21:18:23,758 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-26 21:18:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:23,758 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-26 21:18:23,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:18:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-26 21:18:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:18:23,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:23,783 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-26 21:18:23,783 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-26 21:18:23,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-26 21:18:23,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:23,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300609416] [2019-12-26 21:18:23,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:23,877 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-26 21:18:23,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300609416] [2019-12-26 21:18:23,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:23,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:18:23,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504639549] [2019-12-26 21:18:23,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:18:23,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:18:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:23,880 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-26 21:18:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:25,744 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-26 21:18:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:18:25,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:18:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:25,836 INFO L225 Difference]: With dead ends: 51613 [2019-12-26 21:18:25,836 INFO L226 Difference]: Without dead ends: 51613 [2019-12-26 21:18:25,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:18:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-26 21:18:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-26 21:18:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-26 21:18:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-26 21:18:26,462 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-26 21:18:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:26,462 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-26 21:18:26,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:18:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-26 21:18:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:18:26,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:26,492 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-26 21:18:26,492 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-26 21:18:26,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:26,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-26 21:18:26,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:26,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123530432] [2019-12-26 21:18:26,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:26,595 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-26 21:18:26,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123530432] [2019-12-26 21:18:26,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:26,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:26,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295350569] [2019-12-26 21:18:26,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:18:26,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:18:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:18:26,597 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-26 21:18:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:28,683 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-26 21:18:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:18:28,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 21:18:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:28,829 INFO L225 Difference]: With dead ends: 79921 [2019-12-26 21:18:28,830 INFO L226 Difference]: Without dead ends: 79921 [2019-12-26 21:18:28,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-26 21:18:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-26 21:18:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-26 21:18:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-26 21:18:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-26 21:18:30,306 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-26 21:18:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:30,306 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-26 21:18:30,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:18:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-26 21:18:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:18:30,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:30,331 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] [2019-12-26 21:18:30,332 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-26 21:18:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-26 21:18:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:30,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562098708] [2019-12-26 21:18:30,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:30,416 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-26 21:18:30,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562098708] [2019-12-26 21:18:30,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:30,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:18:30,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721320679] [2019-12-26 21:18:30,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:18:30,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:18:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:30,418 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-26 21:18:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:31,736 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-26 21:18:31,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:18:31,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 21:18:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:31,806 INFO L225 Difference]: With dead ends: 45327 [2019-12-26 21:18:31,806 INFO L226 Difference]: Without dead ends: 45327 [2019-12-26 21:18:31,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:18:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-26 21:18:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-26 21:18:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-26 21:18:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-26 21:18:32,291 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-26 21:18:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:32,291 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-26 21:18:32,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:18:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-26 21:18:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:18:32,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:32,310 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] [2019-12-26 21:18:32,310 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-26 21:18:32,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:32,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-26 21:18:32,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:32,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12924630] [2019-12-26 21:18:32,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:32,434 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-26 21:18:32,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12924630] [2019-12-26 21:18:32,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:32,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:32,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967251216] [2019-12-26 21:18:32,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:18:32,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:18:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:18:32,436 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-26 21:18:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:34,381 INFO L93 Difference]: Finished difference Result 57497 states and 172162 transitions. [2019-12-26 21:18:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:18:34,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-26 21:18:34,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:34,517 INFO L225 Difference]: With dead ends: 57497 [2019-12-26 21:18:34,517 INFO L226 Difference]: Without dead ends: 57497 [2019-12-26 21:18:34,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:18:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57497 states. [2019-12-26 21:18:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57497 to 19933. [2019-12-26 21:18:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19933 states. [2019-12-26 21:18:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19933 states to 19933 states and 61986 transitions. [2019-12-26 21:18:36,153 INFO L78 Accepts]: Start accepts. Automaton has 19933 states and 61986 transitions. Word has length 34 [2019-12-26 21:18:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:36,153 INFO L462 AbstractCegarLoop]: Abstraction has 19933 states and 61986 transitions. [2019-12-26 21:18:36,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:18:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19933 states and 61986 transitions. [2019-12-26 21:18:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:18:36,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:36,174 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-26 21:18:36,174 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-26 21:18:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-26 21:18:36,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:36,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210434786] [2019-12-26 21:18:36,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:36,226 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-26 21:18:36,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210434786] [2019-12-26 21:18:36,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:36,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:18:36,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247093043] [2019-12-26 21:18:36,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:36,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:36,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:36,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:36,229 INFO L87 Difference]: Start difference. First operand 19933 states and 61986 transitions. Second operand 3 states. [2019-12-26 21:18:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:36,308 INFO L93 Difference]: Finished difference Result 19932 states and 61984 transitions. [2019-12-26 21:18:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:36,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:18:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:36,353 INFO L225 Difference]: With dead ends: 19932 [2019-12-26 21:18:36,353 INFO L226 Difference]: Without dead ends: 19932 [2019-12-26 21:18:36,356 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-26 21:18:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2019-12-26 21:18:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 19932. [2019-12-26 21:18:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19932 states. [2019-12-26 21:18:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19932 states to 19932 states and 61984 transitions. [2019-12-26 21:18:36,702 INFO L78 Accepts]: Start accepts. Automaton has 19932 states and 61984 transitions. Word has length 39 [2019-12-26 21:18:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:36,702 INFO L462 AbstractCegarLoop]: Abstraction has 19932 states and 61984 transitions. [2019-12-26 21:18:36,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19932 states and 61984 transitions. [2019-12-26 21:18:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:18:36,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:36,730 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-26 21:18:36,730 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-26 21:18:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-26 21:18:36,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:36,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417044668] [2019-12-26 21:18:36,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:36,774 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-26 21:18:36,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417044668] [2019-12-26 21:18:36,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:36,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:36,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686520992] [2019-12-26 21:18:36,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:36,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:36,776 INFO L87 Difference]: Start difference. First operand 19932 states and 61984 transitions. Second operand 3 states. [2019-12-26 21:18:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:36,916 INFO L93 Difference]: Finished difference Result 34295 states and 106923 transitions. [2019-12-26 21:18:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:36,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 21:18:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:36,952 INFO L225 Difference]: With dead ends: 34295 [2019-12-26 21:18:36,952 INFO L226 Difference]: Without dead ends: 17356 [2019-12-26 21:18:36,953 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-26 21:18:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17356 states. [2019-12-26 21:18:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17356 to 17261. [2019-12-26 21:18:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17261 states. [2019-12-26 21:18:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 52716 transitions. [2019-12-26 21:18:37,442 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 52716 transitions. Word has length 40 [2019-12-26 21:18:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:37,442 INFO L462 AbstractCegarLoop]: Abstraction has 17261 states and 52716 transitions. [2019-12-26 21:18:37,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:18:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 52716 transitions. [2019-12-26 21:18:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:18:37,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:37,478 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-26 21:18:37,478 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-26 21:18:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-26 21:18:37,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:37,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159998711] [2019-12-26 21:18:37,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:37,569 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-26 21:18:37,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159998711] [2019-12-26 21:18:37,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:37,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:18:37,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827454899] [2019-12-26 21:18:37,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:18:37,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:18:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:18:37,572 INFO L87 Difference]: Start difference. First operand 17261 states and 52716 transitions. Second operand 5 states. [2019-12-26 21:18:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:38,301 INFO L93 Difference]: Finished difference Result 28722 states and 85986 transitions. [2019-12-26 21:18:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:18:38,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:18:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:38,365 INFO L225 Difference]: With dead ends: 28722 [2019-12-26 21:18:38,365 INFO L226 Difference]: Without dead ends: 28722 [2019-12-26 21:18:38,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28722 states. [2019-12-26 21:18:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28722 to 22632. [2019-12-26 21:18:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22632 states. [2019-12-26 21:18:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22632 states to 22632 states and 68953 transitions. [2019-12-26 21:18:39,340 INFO L78 Accepts]: Start accepts. Automaton has 22632 states and 68953 transitions. Word has length 40 [2019-12-26 21:18:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:39,340 INFO L462 AbstractCegarLoop]: Abstraction has 22632 states and 68953 transitions. [2019-12-26 21:18:39,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:18:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 22632 states and 68953 transitions. [2019-12-26 21:18:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:18:39,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:39,371 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-26 21:18:39,372 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-26 21:18:39,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 3 times [2019-12-26 21:18:39,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:39,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892672157] [2019-12-26 21:18:39,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:39,469 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-26 21:18:39,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892672157] [2019-12-26 21:18:39,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:39,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:39,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788374851] [2019-12-26 21:18:39,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:18:39,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:39,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:18:39,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:18:39,471 INFO L87 Difference]: Start difference. First operand 22632 states and 68953 transitions. Second operand 6 states. [2019-12-26 21:18:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:40,302 INFO L93 Difference]: Finished difference Result 38264 states and 115758 transitions. [2019-12-26 21:18:40,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:18:40,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 21:18:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:40,357 INFO L225 Difference]: With dead ends: 38264 [2019-12-26 21:18:40,358 INFO L226 Difference]: Without dead ends: 38264 [2019-12-26 21:18:40,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:18:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38264 states. [2019-12-26 21:18:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38264 to 26562. [2019-12-26 21:18:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26562 states. [2019-12-26 21:18:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26562 states to 26562 states and 80887 transitions. [2019-12-26 21:18:40,879 INFO L78 Accepts]: Start accepts. Automaton has 26562 states and 80887 transitions. Word has length 40 [2019-12-26 21:18:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:40,880 INFO L462 AbstractCegarLoop]: Abstraction has 26562 states and 80887 transitions. [2019-12-26 21:18:40,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:18:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26562 states and 80887 transitions. [2019-12-26 21:18:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:18:40,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:40,911 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-26 21:18:40,911 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-26 21:18:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 4 times [2019-12-26 21:18:40,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:40,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733303990] [2019-12-26 21:18:40,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:18:40,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733303990] [2019-12-26 21:18:40,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:40,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:18:40,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240650455] [2019-12-26 21:18:40,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:18:40,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:18:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:18:40,965 INFO L87 Difference]: Start difference. First operand 26562 states and 80887 transitions. Second operand 5 states. [2019-12-26 21:18:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:41,074 INFO L93 Difference]: Finished difference Result 25205 states and 77677 transitions. [2019-12-26 21:18:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:18:41,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:18:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:41,111 INFO L225 Difference]: With dead ends: 25205 [2019-12-26 21:18:41,111 INFO L226 Difference]: Without dead ends: 23175 [2019-12-26 21:18:41,111 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-26 21:18:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23175 states. [2019-12-26 21:18:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23175 to 22090. [2019-12-26 21:18:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22090 states. [2019-12-26 21:18:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22090 states to 22090 states and 69790 transitions. [2019-12-26 21:18:41,507 INFO L78 Accepts]: Start accepts. Automaton has 22090 states and 69790 transitions. Word has length 40 [2019-12-26 21:18:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:41,507 INFO L462 AbstractCegarLoop]: Abstraction has 22090 states and 69790 transitions. [2019-12-26 21:18:41,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:18:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 22090 states and 69790 transitions. [2019-12-26 21:18:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:18:41,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:41,536 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] [2019-12-26 21:18:41,536 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-26 21:18:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash 275512574, now seen corresponding path program 1 times [2019-12-26 21:18:41,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:41,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890536434] [2019-12-26 21:18:41,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:41,620 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-26 21:18:41,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890536434] [2019-12-26 21:18:41,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:41,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:41,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972175875] [2019-12-26 21:18:41,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:18:41,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:18:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:41,623 INFO L87 Difference]: Start difference. First operand 22090 states and 69790 transitions. Second operand 7 states. [2019-12-26 21:18:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:42,144 INFO L93 Difference]: Finished difference Result 71641 states and 223436 transitions. [2019-12-26 21:18:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:18:42,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:18:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:42,218 INFO L225 Difference]: With dead ends: 71641 [2019-12-26 21:18:42,219 INFO L226 Difference]: Without dead ends: 49982 [2019-12-26 21:18:42,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:18:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49982 states. [2019-12-26 21:18:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49982 to 25474. [2019-12-26 21:18:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25474 states. [2019-12-26 21:18:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25474 states to 25474 states and 80471 transitions. [2019-12-26 21:18:43,369 INFO L78 Accepts]: Start accepts. Automaton has 25474 states and 80471 transitions. Word has length 64 [2019-12-26 21:18:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:43,369 INFO L462 AbstractCegarLoop]: Abstraction has 25474 states and 80471 transitions. [2019-12-26 21:18:43,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:18:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25474 states and 80471 transitions. [2019-12-26 21:18:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:18:43,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:43,411 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] [2019-12-26 21:18:43,411 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-26 21:18:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 474826606, now seen corresponding path program 2 times [2019-12-26 21:18:43,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:43,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117424447] [2019-12-26 21:18:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:43,511 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-26 21:18:43,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117424447] [2019-12-26 21:18:43,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:43,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:18:43,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347367307] [2019-12-26 21:18:43,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:18:43,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:18:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:18:43,513 INFO L87 Difference]: Start difference. First operand 25474 states and 80471 transitions. Second operand 8 states. [2019-12-26 21:18:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:44,862 INFO L93 Difference]: Finished difference Result 121319 states and 378413 transitions. [2019-12-26 21:18:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:18:44,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 21:18:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:44,991 INFO L225 Difference]: With dead ends: 121319 [2019-12-26 21:18:44,991 INFO L226 Difference]: Without dead ends: 83520 [2019-12-26 21:18:44,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:18:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83520 states. [2019-12-26 21:18:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83520 to 29763. [2019-12-26 21:18:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29763 states. [2019-12-26 21:18:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29763 states to 29763 states and 93873 transitions. [2019-12-26 21:18:46,652 INFO L78 Accepts]: Start accepts. Automaton has 29763 states and 93873 transitions. Word has length 64 [2019-12-26 21:18:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:46,652 INFO L462 AbstractCegarLoop]: Abstraction has 29763 states and 93873 transitions. [2019-12-26 21:18:46,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:18:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 29763 states and 93873 transitions. [2019-12-26 21:18:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:18:46,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:46,685 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] [2019-12-26 21:18:46,685 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-26 21:18:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1554423936, now seen corresponding path program 3 times [2019-12-26 21:18:46,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:46,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675318235] [2019-12-26 21:18:46,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:46,794 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-26 21:18:46,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675318235] [2019-12-26 21:18:46,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:46,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:18:46,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632768977] [2019-12-26 21:18:46,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:18:46,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:18:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:18:46,796 INFO L87 Difference]: Start difference. First operand 29763 states and 93873 transitions. Second operand 9 states. [2019-12-26 21:18:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:48,802 INFO L93 Difference]: Finished difference Result 183502 states and 569613 transitions. [2019-12-26 21:18:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 21:18:48,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:18:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:49,059 INFO L225 Difference]: With dead ends: 183502 [2019-12-26 21:18:49,059 INFO L226 Difference]: Without dead ends: 147146 [2019-12-26 21:18:49,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 21:18:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147146 states. [2019-12-26 21:18:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147146 to 36901. [2019-12-26 21:18:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36901 states. [2019-12-26 21:18:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36901 states to 36901 states and 116183 transitions. [2019-12-26 21:18:51,416 INFO L78 Accepts]: Start accepts. Automaton has 36901 states and 116183 transitions. Word has length 64 [2019-12-26 21:18:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:51,416 INFO L462 AbstractCegarLoop]: Abstraction has 36901 states and 116183 transitions. [2019-12-26 21:18:51,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:18:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 36901 states and 116183 transitions. [2019-12-26 21:18:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:18:51,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:51,458 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] [2019-12-26 21:18:51,458 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-26 21:18:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash 85476954, now seen corresponding path program 4 times [2019-12-26 21:18:51,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:51,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180665177] [2019-12-26 21:18:51,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:51,553 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-26 21:18:51,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180665177] [2019-12-26 21:18:51,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:51,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:18:51,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864712747] [2019-12-26 21:18:51,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:18:51,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:18:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:18:51,557 INFO L87 Difference]: Start difference. First operand 36901 states and 116183 transitions. Second operand 9 states. [2019-12-26 21:18:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:53,406 INFO L93 Difference]: Finished difference Result 152963 states and 470241 transitions. [2019-12-26 21:18:53,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:18:53,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:18:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:53,628 INFO L225 Difference]: With dead ends: 152963 [2019-12-26 21:18:53,628 INFO L226 Difference]: Without dead ends: 136610 [2019-12-26 21:18:53,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:18:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136610 states. [2019-12-26 21:18:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136610 to 36028. [2019-12-26 21:18:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36028 states. [2019-12-26 21:18:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36028 states to 36028 states and 113146 transitions. [2019-12-26 21:18:55,722 INFO L78 Accepts]: Start accepts. Automaton has 36028 states and 113146 transitions. Word has length 64 [2019-12-26 21:18:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:55,722 INFO L462 AbstractCegarLoop]: Abstraction has 36028 states and 113146 transitions. [2019-12-26 21:18:55,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:18:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 36028 states and 113146 transitions. [2019-12-26 21:18:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:18:55,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:55,764 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] [2019-12-26 21:18:55,764 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-26 21:18:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash 812479892, now seen corresponding path program 5 times [2019-12-26 21:18:55,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:55,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606772432] [2019-12-26 21:18:55,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:55,839 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-26 21:18:55,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606772432] [2019-12-26 21:18:55,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:55,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:18:55,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563279214] [2019-12-26 21:18:55,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:18:55,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:18:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:18:55,841 INFO L87 Difference]: Start difference. First operand 36028 states and 113146 transitions. Second operand 7 states. [2019-12-26 21:18:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:56,339 INFO L93 Difference]: Finished difference Result 78427 states and 241207 transitions. [2019-12-26 21:18:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:18:56,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:18:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:56,437 INFO L225 Difference]: With dead ends: 78427 [2019-12-26 21:18:56,437 INFO L226 Difference]: Without dead ends: 67537 [2019-12-26 21:18:56,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:18:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67537 states. [2019-12-26 21:18:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67537 to 36092. [2019-12-26 21:18:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2019-12-26 21:18:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 113275 transitions. [2019-12-26 21:18:57,898 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 113275 transitions. Word has length 64 [2019-12-26 21:18:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:18:57,898 INFO L462 AbstractCegarLoop]: Abstraction has 36092 states and 113275 transitions. [2019-12-26 21:18:57,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:18:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 113275 transitions. [2019-12-26 21:18:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:18:57,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:18:57,942 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] [2019-12-26 21:18:57,942 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-26 21:18:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:18:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1442601312, now seen corresponding path program 6 times [2019-12-26 21:18:57,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:18:57,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016630393] [2019-12-26 21:18:57,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:18:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:18:57,997 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-26 21:18:57,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016630393] [2019-12-26 21:18:57,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:18:57,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:18:57,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192579484] [2019-12-26 21:18:57,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:18:57,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:18:58,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:18:58,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:18:58,000 INFO L87 Difference]: Start difference. First operand 36092 states and 113275 transitions. Second operand 3 states. [2019-12-26 21:18:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:18:58,224 INFO L93 Difference]: Finished difference Result 43565 states and 135551 transitions. [2019-12-26 21:18:58,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:18:58,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:18:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:18:58,323 INFO L225 Difference]: With dead ends: 43565 [2019-12-26 21:18:58,324 INFO L226 Difference]: Without dead ends: 43565 [2019-12-26 21:18:58,324 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-26 21:18:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43565 states. [2019-12-26 21:18:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43565 to 37697. [2019-12-26 21:18:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37697 states. [2019-12-26 21:19:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37697 states to 37697 states and 118019 transitions. [2019-12-26 21:19:00,090 INFO L78 Accepts]: Start accepts. Automaton has 37697 states and 118019 transitions. Word has length 64 [2019-12-26 21:19:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:00,091 INFO L462 AbstractCegarLoop]: Abstraction has 37697 states and 118019 transitions. [2019-12-26 21:19:00,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 37697 states and 118019 transitions. [2019-12-26 21:19:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:00,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:00,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:00,142 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-26 21:19:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:00,142 INFO L82 PathProgramCache]: Analyzing trace with hash 318332456, now seen corresponding path program 1 times [2019-12-26 21:19:00,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:00,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146497155] [2019-12-26 21:19:00,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:00,224 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-26 21:19:00,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146497155] [2019-12-26 21:19:00,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:00,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:19:00,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590758811] [2019-12-26 21:19:00,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:19:00,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:19:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:19:00,227 INFO L87 Difference]: Start difference. First operand 37697 states and 118019 transitions. Second operand 8 states. [2019-12-26 21:19:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:01,390 INFO L93 Difference]: Finished difference Result 110742 states and 342175 transitions. [2019-12-26 21:19:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:19:01,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:19:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:01,561 INFO L225 Difference]: With dead ends: 110742 [2019-12-26 21:19:01,561 INFO L226 Difference]: Without dead ends: 104366 [2019-12-26 21:19:01,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:19:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104366 states. [2019-12-26 21:19:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104366 to 38232. [2019-12-26 21:19:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38232 states. [2019-12-26 21:19:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38232 states to 38232 states and 119962 transitions. [2019-12-26 21:19:03,590 INFO L78 Accepts]: Start accepts. Automaton has 38232 states and 119962 transitions. Word has length 65 [2019-12-26 21:19:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:03,590 INFO L462 AbstractCegarLoop]: Abstraction has 38232 states and 119962 transitions. [2019-12-26 21:19:03,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:19:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 38232 states and 119962 transitions. [2019-12-26 21:19:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:03,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:03,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:03,644 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-26 21:19:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918528, now seen corresponding path program 2 times [2019-12-26 21:19:03,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:03,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464485186] [2019-12-26 21:19:03,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:03,759 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-26 21:19:03,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464485186] [2019-12-26 21:19:03,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:03,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:19:03,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353194509] [2019-12-26 21:19:03,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:19:03,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:19:03,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:19:03,761 INFO L87 Difference]: Start difference. First operand 38232 states and 119962 transitions. Second operand 9 states. [2019-12-26 21:19:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:05,723 INFO L93 Difference]: Finished difference Result 162694 states and 499460 transitions. [2019-12-26 21:19:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:19:05,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:19:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:05,932 INFO L225 Difference]: With dead ends: 162694 [2019-12-26 21:19:05,932 INFO L226 Difference]: Without dead ends: 133747 [2019-12-26 21:19:05,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:19:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133747 states. [2019-12-26 21:19:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133747 to 40104. [2019-12-26 21:19:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40104 states. [2019-12-26 21:19:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40104 states to 40104 states and 124943 transitions. [2019-12-26 21:19:08,095 INFO L78 Accepts]: Start accepts. Automaton has 40104 states and 124943 transitions. Word has length 65 [2019-12-26 21:19:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:08,095 INFO L462 AbstractCegarLoop]: Abstraction has 40104 states and 124943 transitions. [2019-12-26 21:19:08,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:19:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 40104 states and 124943 transitions. [2019-12-26 21:19:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:08,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:08,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:08,142 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash 704301340, now seen corresponding path program 3 times [2019-12-26 21:19:08,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:08,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100925647] [2019-12-26 21:19:08,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:08,235 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-26 21:19:08,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100925647] [2019-12-26 21:19:08,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:08,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:19:08,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43024998] [2019-12-26 21:19:08,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:19:08,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:08,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:19:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:19:08,240 INFO L87 Difference]: Start difference. First operand 40104 states and 124943 transitions. Second operand 9 states. [2019-12-26 21:19:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:10,455 INFO L93 Difference]: Finished difference Result 132350 states and 403587 transitions. [2019-12-26 21:19:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:19:10,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:19:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:10,653 INFO L225 Difference]: With dead ends: 132350 [2019-12-26 21:19:10,653 INFO L226 Difference]: Without dead ends: 123567 [2019-12-26 21:19:10,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:19:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123567 states. [2019-12-26 21:19:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123567 to 38361. [2019-12-26 21:19:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38361 states. [2019-12-26 21:19:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38361 states to 38361 states and 120038 transitions. [2019-12-26 21:19:12,691 INFO L78 Accepts]: Start accepts. Automaton has 38361 states and 120038 transitions. Word has length 65 [2019-12-26 21:19:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:12,692 INFO L462 AbstractCegarLoop]: Abstraction has 38361 states and 120038 transitions. [2019-12-26 21:19:12,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:19:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38361 states and 120038 transitions. [2019-12-26 21:19:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:12,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:12,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:12,742 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1422061222, now seen corresponding path program 1 times [2019-12-26 21:19:12,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:12,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69768450] [2019-12-26 21:19:12,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:12,842 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-26 21:19:12,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69768450] [2019-12-26 21:19:12,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:12,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:19:12,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694180400] [2019-12-26 21:19:12,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:19:12,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:19:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:19:12,844 INFO L87 Difference]: Start difference. First operand 38361 states and 120038 transitions. Second operand 7 states. [2019-12-26 21:19:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:14,458 INFO L93 Difference]: Finished difference Result 72689 states and 223173 transitions. [2019-12-26 21:19:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:19:14,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:19:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:14,581 INFO L225 Difference]: With dead ends: 72689 [2019-12-26 21:19:14,582 INFO L226 Difference]: Without dead ends: 72689 [2019-12-26 21:19:14,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:19:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72689 states. [2019-12-26 21:19:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72689 to 39164. [2019-12-26 21:19:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39164 states. [2019-12-26 21:19:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39164 states to 39164 states and 122420 transitions. [2019-12-26 21:19:16,000 INFO L78 Accepts]: Start accepts. Automaton has 39164 states and 122420 transitions. Word has length 65 [2019-12-26 21:19:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:16,000 INFO L462 AbstractCegarLoop]: Abstraction has 39164 states and 122420 transitions. [2019-12-26 21:19:16,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:19:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 39164 states and 122420 transitions. [2019-12-26 21:19:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:16,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:16,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:16,053 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1551355630, now seen corresponding path program 4 times [2019-12-26 21:19:16,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:16,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112307107] [2019-12-26 21:19:16,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:16,152 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-26 21:19:16,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112307107] [2019-12-26 21:19:16,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:16,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:19:16,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794945618] [2019-12-26 21:19:16,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:19:16,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:16,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:19:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:19:16,154 INFO L87 Difference]: Start difference. First operand 39164 states and 122420 transitions. Second operand 7 states. [2019-12-26 21:19:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:17,725 INFO L93 Difference]: Finished difference Result 71669 states and 218462 transitions. [2019-12-26 21:19:17,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:19:17,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:19:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:17,839 INFO L225 Difference]: With dead ends: 71669 [2019-12-26 21:19:17,839 INFO L226 Difference]: Without dead ends: 71669 [2019-12-26 21:19:17,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:19:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71669 states. [2019-12-26 21:19:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71669 to 40591. [2019-12-26 21:19:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40591 states. [2019-12-26 21:19:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40591 states to 40591 states and 126291 transitions. [2019-12-26 21:19:19,263 INFO L78 Accepts]: Start accepts. Automaton has 40591 states and 126291 transitions. Word has length 65 [2019-12-26 21:19:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:19,263 INFO L462 AbstractCegarLoop]: Abstraction has 40591 states and 126291 transitions. [2019-12-26 21:19:19,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:19:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40591 states and 126291 transitions. [2019-12-26 21:19:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:19,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:19,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:19,315 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 2 times [2019-12-26 21:19:19,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:19,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910190856] [2019-12-26 21:19:19,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:19,497 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-26 21:19:19,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910190856] [2019-12-26 21:19:19,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:19,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:19:19,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567737165] [2019-12-26 21:19:19,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:19:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:19:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:19:19,500 INFO L87 Difference]: Start difference. First operand 40591 states and 126291 transitions. Second operand 8 states. [2019-12-26 21:19:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:21,467 INFO L93 Difference]: Finished difference Result 83304 states and 256159 transitions. [2019-12-26 21:19:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:19:21,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:19:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:21,601 INFO L225 Difference]: With dead ends: 83304 [2019-12-26 21:19:21,601 INFO L226 Difference]: Without dead ends: 83304 [2019-12-26 21:19:21,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:19:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83304 states. [2019-12-26 21:19:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83304 to 42985. [2019-12-26 21:19:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42985 states. [2019-12-26 21:19:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42985 states to 42985 states and 134776 transitions. [2019-12-26 21:19:23,037 INFO L78 Accepts]: Start accepts. Automaton has 42985 states and 134776 transitions. Word has length 65 [2019-12-26 21:19:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:23,037 INFO L462 AbstractCegarLoop]: Abstraction has 42985 states and 134776 transitions. [2019-12-26 21:19:23,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:19:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 42985 states and 134776 transitions. [2019-12-26 21:19:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:23,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:23,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:23,088 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 3 times [2019-12-26 21:19:23,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:23,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531275478] [2019-12-26 21:19:23,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:23,417 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-26 21:19:23,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531275478] [2019-12-26 21:19:23,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:23,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:19:23,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260007035] [2019-12-26 21:19:23,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 21:19:23,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 21:19:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:19:23,420 INFO L87 Difference]: Start difference. First operand 42985 states and 134776 transitions. Second operand 13 states. [2019-12-26 21:19:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:27,724 INFO L93 Difference]: Finished difference Result 84786 states and 259894 transitions. [2019-12-26 21:19:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-26 21:19:27,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-26 21:19:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:27,860 INFO L225 Difference]: With dead ends: 84786 [2019-12-26 21:19:27,861 INFO L226 Difference]: Without dead ends: 84534 [2019-12-26 21:19:27,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=455, Invalid=1897, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 21:19:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84534 states. [2019-12-26 21:19:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84534 to 48425. [2019-12-26 21:19:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48425 states. [2019-12-26 21:19:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48425 states to 48425 states and 151617 transitions. [2019-12-26 21:19:29,368 INFO L78 Accepts]: Start accepts. Automaton has 48425 states and 151617 transitions. Word has length 65 [2019-12-26 21:19:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:29,368 INFO L462 AbstractCegarLoop]: Abstraction has 48425 states and 151617 transitions. [2019-12-26 21:19:29,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 21:19:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48425 states and 151617 transitions. [2019-12-26 21:19:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:19:29,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:29,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:19:29,427 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash 25454022, now seen corresponding path program 4 times [2019-12-26 21:19:29,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:29,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876778070] [2019-12-26 21:19:29,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:29,484 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-26 21:19:29,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876778070] [2019-12-26 21:19:29,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:29,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:19:29,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628526762] [2019-12-26 21:19:29,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:19:29,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:19:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:19:29,486 INFO L87 Difference]: Start difference. First operand 48425 states and 151617 transitions. Second operand 3 states. [2019-12-26 21:19:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:29,718 INFO L93 Difference]: Finished difference Result 48425 states and 151616 transitions. [2019-12-26 21:19:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:19:29,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:19:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:29,833 INFO L225 Difference]: With dead ends: 48425 [2019-12-26 21:19:29,833 INFO L226 Difference]: Without dead ends: 48425 [2019-12-26 21:19:29,833 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-26 21:19:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48425 states. [2019-12-26 21:19:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48425 to 33950. [2019-12-26 21:19:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33950 states. [2019-12-26 21:19:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33950 states to 33950 states and 107321 transitions. [2019-12-26 21:19:31,093 INFO L78 Accepts]: Start accepts. Automaton has 33950 states and 107321 transitions. Word has length 65 [2019-12-26 21:19:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:31,094 INFO L462 AbstractCegarLoop]: Abstraction has 33950 states and 107321 transitions. [2019-12-26 21:19:31,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 33950 states and 107321 transitions. [2019-12-26 21:19:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:19:31,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:31,139 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-26 21:19:31,139 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash -927878062, now seen corresponding path program 1 times [2019-12-26 21:19:31,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:31,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110034165] [2019-12-26 21:19:31,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:19:31,189 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-26 21:19:31,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110034165] [2019-12-26 21:19:31,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:19:31,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:19:31,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912395043] [2019-12-26 21:19:31,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:19:31,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:19:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:19:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:19:31,191 INFO L87 Difference]: Start difference. First operand 33950 states and 107321 transitions. Second operand 3 states. [2019-12-26 21:19:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:19:31,310 INFO L93 Difference]: Finished difference Result 24609 states and 77327 transitions. [2019-12-26 21:19:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:19:31,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:19:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:19:31,359 INFO L225 Difference]: With dead ends: 24609 [2019-12-26 21:19:31,359 INFO L226 Difference]: Without dead ends: 24609 [2019-12-26 21:19:31,359 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-26 21:19:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24609 states. [2019-12-26 21:19:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24609 to 22054. [2019-12-26 21:19:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22054 states. [2019-12-26 21:19:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22054 states to 22054 states and 69094 transitions. [2019-12-26 21:19:31,735 INFO L78 Accepts]: Start accepts. Automaton has 22054 states and 69094 transitions. Word has length 66 [2019-12-26 21:19:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:19:31,735 INFO L462 AbstractCegarLoop]: Abstraction has 22054 states and 69094 transitions. [2019-12-26 21:19:31,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:19:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 22054 states and 69094 transitions. [2019-12-26 21:19:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:19:31,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:19:31,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:19:31,762 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:19:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:19:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-26 21:19:31,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:19:31,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336126327] [2019-12-26 21:19:31,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:19:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:19:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:19:31,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:19:31,898 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:19:31,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_27| 4) |v_#length_23|) (= v_~weak$$choice2~0_147 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= |v_ULTIMATE.start_main_~#t153~0.offset_17| 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27| 1) |v_#valid_73|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27|) 0) (= 0 v_~x~0_154) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_27|) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27|) |v_ULTIMATE.start_main_~#t153~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_27|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_22|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t153~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t155~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t154~0.base, ULTIMATE.start_main_~#t155~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t153~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:19:31,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t154~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t154~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11|) |v_ULTIMATE.start_main_~#t154~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t154~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t154~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t154~0.base] because there is no mapped edge [2019-12-26 21:19:31,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 21:19:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-737982094 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-737982094 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-737982094 |P1Thread1of1ForFork2_#t~ite9_Out-737982094|)) (and (= ~z~0_In-737982094 |P1Thread1of1ForFork2_#t~ite9_Out-737982094|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-737982094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-737982094, ~z$w_buff1~0=~z$w_buff1~0_In-737982094, ~z~0=~z~0_In-737982094} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-737982094|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-737982094, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-737982094, ~z$w_buff1~0=~z$w_buff1~0_In-737982094, ~z~0=~z~0_In-737982094} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:19:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 21:19:31,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1467460324 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1467460324 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1467460324|)) (and (= ~z$w_buff0_used~0_In-1467460324 |P1Thread1of1ForFork2_#t~ite11_Out-1467460324|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1467460324, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1467460324} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1467460324, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1467460324|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1467460324} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:19:31,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1870800339 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1870800339 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1870800339 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1870800339 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1870800339| ~z$w_buff1_used~0_In-1870800339) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1870800339|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1870800339, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1870800339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1870800339, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1870800339} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1870800339, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1870800339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1870800339, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1870800339|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1870800339} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:19:31,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9|) |v_ULTIMATE.start_main_~#t155~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t155~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t155~0.base_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t155~0.base_9| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t155~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t155~0.base, ULTIMATE.start_main_~#t155~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 21:19:31,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In674660640 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out674660640| ~z$w_buff0~0_In674660640) (= |P2Thread1of1ForFork0_#t~ite20_In674660640| |P2Thread1of1ForFork0_#t~ite20_Out674660640|) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In674660640 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In674660640 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In674660640 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In674660640 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite20_Out674660640| ~z$w_buff0~0_In674660640) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out674660640| |P2Thread1of1ForFork0_#t~ite20_Out674660640|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In674660640, ~z$w_buff0_used~0=~z$w_buff0_used~0_In674660640, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In674660640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In674660640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In674660640, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In674660640|, ~weak$$choice2~0=~weak$$choice2~0_In674660640} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out674660640|, ~z$w_buff0~0=~z$w_buff0~0_In674660640, ~z$w_buff0_used~0=~z$w_buff0_used~0_In674660640, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In674660640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In674660640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In674660640, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out674660640|, ~weak$$choice2~0=~weak$$choice2~0_In674660640} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:19:31,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In119660047 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In119660047 256)))) (or (and (= ~z$r_buff0_thd2~0_In119660047 |P1Thread1of1ForFork2_#t~ite13_Out119660047|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out119660047|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In119660047, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In119660047} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In119660047, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out119660047|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In119660047} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:19:31,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1483394937 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1483394937 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1483394937 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1483394937 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1483394937 |P1Thread1of1ForFork2_#t~ite14_Out1483394937|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1483394937|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1483394937, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1483394937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483394937, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1483394937} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1483394937, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1483394937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1483394937, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1483394937|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1483394937} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:19:31,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:19:31,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1751636263 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-1751636263| |P2Thread1of1ForFork0_#t~ite23_Out-1751636263|) (= ~z$w_buff1~0_In-1751636263 |P2Thread1of1ForFork0_#t~ite24_Out-1751636263|) (not .cse0)) (and (= ~z$w_buff1~0_In-1751636263 |P2Thread1of1ForFork0_#t~ite23_Out-1751636263|) (= |P2Thread1of1ForFork0_#t~ite24_Out-1751636263| |P2Thread1of1ForFork0_#t~ite23_Out-1751636263|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1751636263 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-1751636263 256) 0)) (= (mod ~z$w_buff0_used~0_In-1751636263 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1751636263 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751636263, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1751636263, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1751636263|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751636263, ~z$w_buff1~0=~z$w_buff1~0_In-1751636263, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1751636263, ~weak$$choice2~0=~weak$$choice2~0_In-1751636263} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751636263, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1751636263|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1751636263, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1751636263|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1751636263, ~z$w_buff1~0=~z$w_buff1~0_In-1751636263, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1751636263, ~weak$$choice2~0=~weak$$choice2~0_In-1751636263} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 21:19:31,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1056641265 256)))) (or (and (= ~z$w_buff0_used~0_In1056641265 |P2Thread1of1ForFork0_#t~ite26_Out1056641265|) (= |P2Thread1of1ForFork0_#t~ite26_Out1056641265| |P2Thread1of1ForFork0_#t~ite27_Out1056641265|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1056641265 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In1056641265 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In1056641265 256) 0) (and (= (mod ~z$w_buff1_used~0_In1056641265 256) 0) .cse0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite26_In1056641265| |P2Thread1of1ForFork0_#t~ite26_Out1056641265|) (= ~z$w_buff0_used~0_In1056641265 |P2Thread1of1ForFork0_#t~ite27_Out1056641265|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1056641265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1056641265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1056641265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1056641265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1056641265, ~weak$$choice2~0=~weak$$choice2~0_In1056641265} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1056641265|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1056641265|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1056641265, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1056641265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1056641265, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1056641265, ~weak$$choice2~0=~weak$$choice2~0_In1056641265} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:19:31,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:19:31,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 21:19:31,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1173651237 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1173651237 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1173651237| ~z$w_buff0_used~0_In-1173651237)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-1173651237| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1173651237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1173651237} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1173651237|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1173651237, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1173651237} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:19:31,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2016356723 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In2016356723 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out2016356723| ~z$w_buff1~0_In2016356723) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out2016356723| ~z~0_In2016356723) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2016356723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2016356723, ~z$w_buff1~0=~z$w_buff1~0_In2016356723, ~z~0=~z~0_In2016356723} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2016356723|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2016356723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2016356723, ~z$w_buff1~0=~z$w_buff1~0_In2016356723, ~z~0=~z~0_In2016356723} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:19:31,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-2006089832 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-2006089832 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2006089832 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-2006089832 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-2006089832| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-2006089832| ~z$w_buff1_used~0_In-2006089832) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2006089832, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2006089832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2006089832, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2006089832} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2006089832, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2006089832|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2006089832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2006089832, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2006089832} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:19:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In355960021 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In355960021 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out355960021 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out355960021 ~z$r_buff0_thd1~0_In355960021) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In355960021, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In355960021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In355960021, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out355960021|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out355960021} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:19:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-872108170 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-872108170 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-872108170 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-872108170 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-872108170|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-872108170 |P0Thread1of1ForFork1_#t~ite8_Out-872108170|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-872108170, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-872108170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872108170, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-872108170} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-872108170|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-872108170, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-872108170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-872108170, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-872108170} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:19:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:19:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-26 21:19:31,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1286551387 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1286551387 256)))) (or (and (= ~z$w_buff0_used~0_In1286551387 |P2Thread1of1ForFork0_#t~ite40_Out1286551387|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1286551387|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1286551387, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1286551387} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1286551387, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1286551387|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1286551387} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:19:31,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1555542158 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1555542158 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1555542158 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1555542158 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1555542158| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-1555542158| ~z$w_buff1_used~0_In-1555542158)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1555542158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1555542158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1555542158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1555542158} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1555542158, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1555542158, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1555542158, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1555542158, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1555542158|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:19:31,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1369204416 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1369204416 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1369204416|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1369204416| ~z$r_buff0_thd3~0_In1369204416)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1369204416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1369204416} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1369204416, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1369204416, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1369204416|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:19:31,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-198469842 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-198469842 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-198469842 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-198469842 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-198469842| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-198469842 |P2Thread1of1ForFork0_#t~ite43_Out-198469842|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-198469842, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-198469842, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-198469842, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-198469842} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-198469842|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-198469842, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-198469842, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-198469842, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-198469842} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:19:31,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:19:31,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:19:31,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1559937953| |ULTIMATE.start_main_#t~ite47_Out-1559937953|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1559937953 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1559937953 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1559937953| ~z$w_buff1~0_In-1559937953)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In-1559937953 |ULTIMATE.start_main_#t~ite47_Out-1559937953|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1559937953, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1559937953, ~z$w_buff1~0=~z$w_buff1~0_In-1559937953, ~z~0=~z~0_In-1559937953} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1559937953, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1559937953|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1559937953, ~z$w_buff1~0=~z$w_buff1~0_In-1559937953, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1559937953|, ~z~0=~z~0_In-1559937953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:19:31,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-880366938 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-880366938 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-880366938| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-880366938| ~z$w_buff0_used~0_In-880366938)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-880366938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-880366938} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-880366938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-880366938, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-880366938|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:19:31,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-252641361 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-252641361 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-252641361 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-252641361 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-252641361|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-252641361 |ULTIMATE.start_main_#t~ite50_Out-252641361|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-252641361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-252641361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-252641361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-252641361} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-252641361|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-252641361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-252641361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-252641361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-252641361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:19:31,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1770963547 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1770963547 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1770963547| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1770963547 |ULTIMATE.start_main_#t~ite51_Out1770963547|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1770963547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1770963547} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1770963547, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1770963547|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1770963547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:19:31,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In388891402 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In388891402 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In388891402 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In388891402 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In388891402 |ULTIMATE.start_main_#t~ite52_Out388891402|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out388891402| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388891402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388891402, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388891402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388891402} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out388891402|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388891402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388891402, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In388891402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388891402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:19:31,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:19:32,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:19:32 BasicIcfg [2019-12-26 21:19:32,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:19:32,026 INFO L168 Benchmark]: Toolchain (without parser) took 136980.31 ms. Allocated memory was 137.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,027 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.06 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 152.4 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.72 ms. Allocated memory is still 201.3 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,028 INFO L168 Benchmark]: Boogie Preprocessor took 42.50 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,029 INFO L168 Benchmark]: RCFGBuilder took 972.77 ms. Allocated memory is still 201.3 MB. Free memory was 147.6 MB in the beginning and 96.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,029 INFO L168 Benchmark]: TraceAbstraction took 135072.53 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 96.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 21:19:32,033 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.56 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.06 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 152.4 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.72 ms. Allocated memory is still 201.3 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.50 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 972.77 ms. Allocated memory is still 201.3 MB. Free memory was 147.6 MB in the beginning and 96.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135072.53 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 96.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 45.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8522 SDtfs, 14503 SDslu, 25787 SDs, 0 SdLazy, 17558 SolverSat, 1022 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred 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: 60.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 964628 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1515 NumberOfCodeBlocks, 1515 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1416 ConstructedInterpolants, 0 QuantifiedInterpolants, 274837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...