/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/mix047_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:46:16,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:46:16,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:46:16,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:46:16,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:46:16,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:46:16,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:46:16,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:46:16,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:46:16,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:46:16,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:46:16,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:46:16,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:46:16,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:46:16,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:46:16,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:46:16,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:46:16,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:46:16,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:46:16,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:46:16,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:46:16,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:46:16,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:46:16,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:46:16,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:46:16,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:46:16,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:46:16,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:46:16,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:46:16,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:46:16,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:46:16,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:46:16,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:46:16,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:46:16,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:46:16,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:46:16,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:46:16,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:46:16,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:46:16,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:46:16,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:46:16,773 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 22:46:16,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:46:16,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:46:16,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:46:16,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:46:16,790 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:46:16,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:46:16,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:46:16,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:46:16,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:46:16,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:46:16,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:46:16,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:46:16,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:46:16,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:46:16,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:46:16,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:46:16,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:46:16,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:46:16,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:46:16,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:46:16,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:46:16,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:46:16,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:46:16,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:46:16,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:46:16,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:46:16,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:46:16,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:46:16,795 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:46:16,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:46:17,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:46:17,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:46:17,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:46:17,118 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:46:17,119 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:46:17,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-26 22:46:17,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b247500/b8affcef2fd544e8b824d4215d7e0d7a/FLAGdc0ec388b [2019-12-26 22:46:17,784 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:46:17,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-26 22:46:17,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b247500/b8affcef2fd544e8b824d4215d7e0d7a/FLAGdc0ec388b [2019-12-26 22:46:18,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b247500/b8affcef2fd544e8b824d4215d7e0d7a [2019-12-26 22:46:18,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:46:18,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:46:18,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:46:18,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:46:18,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:46:18,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:18,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18, skipping insertion in model container [2019-12-26 22:46:18,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:18,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:46:18,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:46:18,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:46:18,770 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:46:18,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:46:18,911 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:46:18,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18 WrapperNode [2019-12-26 22:46:18,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:46:18,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:46:18,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:46:18,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:46:18,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:18,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:18,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:46:18,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:46:18,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:46:18,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:46:18,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:18,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:19,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:19,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:19,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:19,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:19,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (1/1) ... [2019-12-26 22:46:19,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:46:19,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:46:19,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:46:19,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:46:19,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (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 22:46:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:46:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:46:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:46:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:46:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:46:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:46:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:46:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:46:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:46:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:46:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:46:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:46:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:46:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:46:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:46:19,100 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 22:46:19,867 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:46:19,867 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:46:19,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:46:19 BoogieIcfgContainer [2019-12-26 22:46:19,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:46:19,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:46:19,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:46:19,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:46:19,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:46:18" (1/3) ... [2019-12-26 22:46:19,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d0c816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:46:19, skipping insertion in model container [2019-12-26 22:46:19,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:46:18" (2/3) ... [2019-12-26 22:46:19,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d0c816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:46:19, skipping insertion in model container [2019-12-26 22:46:19,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:46:19" (3/3) ... [2019-12-26 22:46:19,878 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.oepc.i [2019-12-26 22:46:19,888 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:46:19,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:46:19,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:46:19,898 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:46:19,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,959 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,960 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,960 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,961 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,961 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,962 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,963 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,964 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,965 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,966 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,967 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,968 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,986 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,986 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,987 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,988 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,988 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:19,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:46:20,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:46:20,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:46:20,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:46:20,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:46:20,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:46:20,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:46:20,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:46:20,044 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:46:20,044 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:46:20,062 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-26 22:46:20,064 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:46:20,163 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:46:20,163 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:46:20,180 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:46:20,203 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:46:20,254 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:46:20,255 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:46:20,261 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:46:20,277 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:46:20,278 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:46:25,544 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 22:46:25,682 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 22:46:25,743 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-26 22:46:25,743 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-26 22:46:25,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-26 22:46:28,806 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-26 22:46:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-26 22:46:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:46:28,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:28,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:28,819 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-26 22:46:28,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:28,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726224307] [2019-12-26 22:46:28,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:29,082 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 22:46:29,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726224307] [2019-12-26 22:46:29,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:29,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:46:29,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314286860] [2019-12-26 22:46:29,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:29,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:29,108 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-26 22:46:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:29,660 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-26 22:46:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:29,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:46:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:29,982 INFO L225 Difference]: With dead ends: 34366 [2019-12-26 22:46:29,983 INFO L226 Difference]: Without dead ends: 33638 [2019-12-26 22:46:29,985 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 22:46:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-26 22:46:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-26 22:46:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-26 22:46:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-26 22:46:32,708 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-26 22:46:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:32,710 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-26 22:46:32,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-26 22:46:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:46:32,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:32,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:32,726 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-26 22:46:32,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:32,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079024742] [2019-12-26 22:46:32,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:32,859 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 22:46:32,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079024742] [2019-12-26 22:46:32,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:32,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:32,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934027445] [2019-12-26 22:46:32,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:46:32,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:46:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:46:32,864 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-26 22:46:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:34,972 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-26 22:46:34,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:46:34,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:46:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:35,234 INFO L225 Difference]: With dead ends: 52350 [2019-12-26 22:46:35,234 INFO L226 Difference]: Without dead ends: 52322 [2019-12-26 22:46:35,235 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 22:46:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-26 22:46:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-26 22:46:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-26 22:46:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-26 22:46:37,262 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-26 22:46:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:37,262 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-26 22:46:37,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:46:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-26 22:46:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:46:37,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:37,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:37,267 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-26 22:46:37,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:37,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136342772] [2019-12-26 22:46:37,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:37,375 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 22:46:37,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136342772] [2019-12-26 22:46:37,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:37,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:37,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361774566] [2019-12-26 22:46:37,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:37,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:37,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:37,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:37,380 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-26 22:46:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:37,541 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-26 22:46:37,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:37,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:46:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:37,685 INFO L225 Difference]: With dead ends: 37462 [2019-12-26 22:46:37,686 INFO L226 Difference]: Without dead ends: 37462 [2019-12-26 22:46:37,686 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 22:46:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-26 22:46:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-26 22:46:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-26 22:46:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-26 22:46:40,595 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-26 22:46:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:40,596 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-26 22:46:40,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-26 22:46:40,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:46:40,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:40,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:40,598 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-26 22:46:40,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:40,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664766511] [2019-12-26 22:46:40,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:40,670 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 22:46:40,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664766511] [2019-12-26 22:46:40,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:40,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:46:40,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814046603] [2019-12-26 22:46:40,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:46:40,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:46:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:46:40,672 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-26 22:46:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:40,744 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-26 22:46:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:46:40,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:46:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:40,777 INFO L225 Difference]: With dead ends: 15610 [2019-12-26 22:46:40,777 INFO L226 Difference]: Without dead ends: 15610 [2019-12-26 22:46:40,778 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 22:46:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-26 22:46:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-26 22:46:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-26 22:46:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-26 22:46:41,433 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-26 22:46:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:41,433 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-26 22:46:41,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:46:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-26 22:46:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:46:41,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:41,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:46:41,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:41,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-26 22:46:41,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:41,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115041542] [2019-12-26 22:46:41,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:41,493 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 22:46:41,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115041542] [2019-12-26 22:46:41,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:41,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:46:41,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613199216] [2019-12-26 22:46:41,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:46:41,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:46:41,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:46:41,495 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-26 22:46:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:41,539 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-26 22:46:41,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:46:41,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:46:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:41,544 INFO L225 Difference]: With dead ends: 2718 [2019-12-26 22:46:41,544 INFO L226 Difference]: Without dead ends: 2718 [2019-12-26 22:46:41,545 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 22:46:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-26 22:46:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-26 22:46:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-26 22:46:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-26 22:46:41,580 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-26 22:46:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:41,580 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-26 22:46:41,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:46:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-26 22:46:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:46:41,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:41,585 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] [2019-12-26 22:46:41,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:41,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:41,586 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-26 22:46:41,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:41,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477184935] [2019-12-26 22:46:41,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:41,679 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 22:46:41,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477184935] [2019-12-26 22:46:41,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:41,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:41,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528307668] [2019-12-26 22:46:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:41,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:41,681 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-26 22:46:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:41,735 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-26 22:46:41,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:41,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:46:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:41,738 INFO L225 Difference]: With dead ends: 1354 [2019-12-26 22:46:41,739 INFO L226 Difference]: Without dead ends: 1354 [2019-12-26 22:46:41,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-26 22:46:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-26 22:46:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-26 22:46:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-26 22:46:41,762 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-26 22:46:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:41,764 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-26 22:46:41,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-26 22:46:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:41,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:41,773 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] [2019-12-26 22:46:41,773 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-26 22:46:41,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:41,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474857390] [2019-12-26 22:46:41,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:41,917 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 22:46:41,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474857390] [2019-12-26 22:46:41,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:41,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:46:41,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946003519] [2019-12-26 22:46:41,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:41,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:41,920 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-26 22:46:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:41,964 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-26 22:46:41,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:41,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:46:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:41,968 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 22:46:41,968 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 22:46:41,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 22:46:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-26 22:46:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:46:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-26 22:46:41,991 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-26 22:46:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:41,993 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-26 22:46:41,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-26 22:46:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:41,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:41,996 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] [2019-12-26 22:46:41,996 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-26 22:46:41,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:41,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989922628] [2019-12-26 22:46:41,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:42,138 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 22:46:42,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989922628] [2019-12-26 22:46:42,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:42,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:42,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285441065] [2019-12-26 22:46:42,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:46:42,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:46:42,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:46:42,141 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-26 22:46:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:42,388 INFO L93 Difference]: Finished difference Result 1758 states and 5009 transitions. [2019-12-26 22:46:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:42,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 22:46:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:42,392 INFO L225 Difference]: With dead ends: 1758 [2019-12-26 22:46:42,392 INFO L226 Difference]: Without dead ends: 1758 [2019-12-26 22:46:42,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2019-12-26 22:46:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1413. [2019-12-26 22:46:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-12-26 22:46:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 4063 transitions. [2019-12-26 22:46:42,425 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 4063 transitions. Word has length 58 [2019-12-26 22:46:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:42,426 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 4063 transitions. [2019-12-26 22:46:42,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:46:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 4063 transitions. [2019-12-26 22:46:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:42,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:42,431 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] [2019-12-26 22:46:42,432 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2139138521, now seen corresponding path program 2 times [2019-12-26 22:46:42,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:42,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538694038] [2019-12-26 22:46:42,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:42,582 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 22:46:42,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538694038] [2019-12-26 22:46:42,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:42,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:46:42,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652012358] [2019-12-26 22:46:42,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:42,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:42,585 INFO L87 Difference]: Start difference. First operand 1413 states and 4063 transitions. Second operand 6 states. [2019-12-26 22:46:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:42,945 INFO L93 Difference]: Finished difference Result 2360 states and 6721 transitions. [2019-12-26 22:46:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:46:42,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:46:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:42,951 INFO L225 Difference]: With dead ends: 2360 [2019-12-26 22:46:42,951 INFO L226 Difference]: Without dead ends: 2360 [2019-12-26 22:46:42,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:46:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-12-26 22:46:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1497. [2019-12-26 22:46:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-12-26 22:46:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 4311 transitions. [2019-12-26 22:46:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 4311 transitions. Word has length 58 [2019-12-26 22:46:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:42,977 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 4311 transitions. [2019-12-26 22:46:42,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 4311 transitions. [2019-12-26 22:46:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:42,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:42,981 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] [2019-12-26 22:46:42,981 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1500936233, now seen corresponding path program 3 times [2019-12-26 22:46:42,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:42,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498302218] [2019-12-26 22:46:42,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:43,095 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 22:46:43,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498302218] [2019-12-26 22:46:43,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:43,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:46:43,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659983086] [2019-12-26 22:46:43,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:43,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:43,098 INFO L87 Difference]: Start difference. First operand 1497 states and 4311 transitions. Second operand 6 states. [2019-12-26 22:46:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:43,459 INFO L93 Difference]: Finished difference Result 2371 states and 6747 transitions. [2019-12-26 22:46:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:46:43,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:46:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:43,465 INFO L225 Difference]: With dead ends: 2371 [2019-12-26 22:46:43,465 INFO L226 Difference]: Without dead ends: 2371 [2019-12-26 22:46:43,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:46:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-26 22:46:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1685. [2019-12-26 22:46:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-26 22:46:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 4855 transitions. [2019-12-26 22:46:43,502 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 4855 transitions. Word has length 58 [2019-12-26 22:46:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:43,502 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 4855 transitions. [2019-12-26 22:46:43,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 4855 transitions. [2019-12-26 22:46:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:46:43,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:43,508 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] [2019-12-26 22:46:43,508 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash -774913423, now seen corresponding path program 4 times [2019-12-26 22:46:43,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:43,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378460711] [2019-12-26 22:46:43,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:43,685 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 22:46:43,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378460711] [2019-12-26 22:46:43,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:43,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:46:43,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545765754] [2019-12-26 22:46:43,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:46:43,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:43,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:46:43,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:46:43,687 INFO L87 Difference]: Start difference. First operand 1685 states and 4855 transitions. Second operand 8 states. [2019-12-26 22:46:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:44,423 INFO L93 Difference]: Finished difference Result 2624 states and 7473 transitions. [2019-12-26 22:46:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:46:44,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-26 22:46:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:44,429 INFO L225 Difference]: With dead ends: 2624 [2019-12-26 22:46:44,429 INFO L226 Difference]: Without dead ends: 2624 [2019-12-26 22:46:44,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:46:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-12-26 22:46:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1601. [2019-12-26 22:46:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-26 22:46:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 4607 transitions. [2019-12-26 22:46:44,464 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 4607 transitions. Word has length 58 [2019-12-26 22:46:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:44,464 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 4607 transitions. [2019-12-26 22:46:44,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:46:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 4607 transitions. [2019-12-26 22:46:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:46:44,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:44,469 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] [2019-12-26 22:46:44,469 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:44,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:44,469 INFO L82 PathProgramCache]: Analyzing trace with hash -240075320, now seen corresponding path program 1 times [2019-12-26 22:46:44,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:44,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006377495] [2019-12-26 22:46:44,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:44,742 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 22:46:44,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006377495] [2019-12-26 22:46:44,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:44,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:46:44,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913545570] [2019-12-26 22:46:44,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:46:44,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:44,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:46:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:46:44,744 INFO L87 Difference]: Start difference. First operand 1601 states and 4607 transitions. Second operand 12 states. [2019-12-26 22:46:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:46,046 INFO L93 Difference]: Finished difference Result 4251 states and 11313 transitions. [2019-12-26 22:46:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 22:46:46,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-26 22:46:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:46,051 INFO L225 Difference]: With dead ends: 4251 [2019-12-26 22:46:46,051 INFO L226 Difference]: Without dead ends: 2556 [2019-12-26 22:46:46,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 22:46:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2019-12-26 22:46:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1471. [2019-12-26 22:46:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-26 22:46:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4167 transitions. [2019-12-26 22:46:46,085 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4167 transitions. Word has length 59 [2019-12-26 22:46:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:46,085 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 4167 transitions. [2019-12-26 22:46:46,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:46:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4167 transitions. [2019-12-26 22:46:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:46:46,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:46,089 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] [2019-12-26 22:46:46,089 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2057740932, now seen corresponding path program 2 times [2019-12-26 22:46:46,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:46,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422322982] [2019-12-26 22:46:46,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:46,169 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 22:46:46,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422322982] [2019-12-26 22:46:46,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:46,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:46,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421613041] [2019-12-26 22:46:46,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:46,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:46,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:46,171 INFO L87 Difference]: Start difference. First operand 1471 states and 4167 transitions. Second operand 3 states. [2019-12-26 22:46:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:46,216 INFO L93 Difference]: Finished difference Result 1471 states and 4166 transitions. [2019-12-26 22:46:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:46,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:46:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:46,219 INFO L225 Difference]: With dead ends: 1471 [2019-12-26 22:46:46,219 INFO L226 Difference]: Without dead ends: 1471 [2019-12-26 22:46:46,219 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 22:46:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-12-26 22:46:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 946. [2019-12-26 22:46:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-26 22:46:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2684 transitions. [2019-12-26 22:46:46,241 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2684 transitions. Word has length 59 [2019-12-26 22:46:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:46,241 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2684 transitions. [2019-12-26 22:46:46,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2684 transitions. [2019-12-26 22:46:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:46:46,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:46,244 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] [2019-12-26 22:46:46,244 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1360237091, now seen corresponding path program 1 times [2019-12-26 22:46:46,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:46,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623289619] [2019-12-26 22:46:46,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:46,316 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 22:46:46,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623289619] [2019-12-26 22:46:46,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:46,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:46:46,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852541604] [2019-12-26 22:46:46,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:46:46,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:46:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:46:46,318 INFO L87 Difference]: Start difference. First operand 946 states and 2684 transitions. Second operand 3 states. [2019-12-26 22:46:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:46,334 INFO L93 Difference]: Finished difference Result 890 states and 2456 transitions. [2019-12-26 22:46:46,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:46:46,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:46:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:46,337 INFO L225 Difference]: With dead ends: 890 [2019-12-26 22:46:46,337 INFO L226 Difference]: Without dead ends: 890 [2019-12-26 22:46:46,338 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 22:46:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-26 22:46:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 826. [2019-12-26 22:46:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-26 22:46:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2272 transitions. [2019-12-26 22:46:46,352 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2272 transitions. Word has length 59 [2019-12-26 22:46:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:46,352 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 2272 transitions. [2019-12-26 22:46:46,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:46:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2272 transitions. [2019-12-26 22:46:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:46,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:46,355 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] [2019-12-26 22:46:46,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1465585068, now seen corresponding path program 1 times [2019-12-26 22:46:46,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:46,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943003985] [2019-12-26 22:46:46,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:46,536 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 22:46:46,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943003985] [2019-12-26 22:46:46,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:46,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:46,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436788703] [2019-12-26 22:46:46,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:46,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:46,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:46,539 INFO L87 Difference]: Start difference. First operand 826 states and 2272 transitions. Second operand 6 states. [2019-12-26 22:46:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:46,643 INFO L93 Difference]: Finished difference Result 1418 states and 3614 transitions. [2019-12-26 22:46:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:46,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 22:46:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:46,645 INFO L225 Difference]: With dead ends: 1418 [2019-12-26 22:46:46,645 INFO L226 Difference]: Without dead ends: 779 [2019-12-26 22:46:46,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:46:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-12-26 22:46:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 600. [2019-12-26 22:46:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-26 22:46:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-26 22:46:46,659 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-26 22:46:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:46,659 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-26 22:46:46,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-26 22:46:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:46,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:46,661 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] [2019-12-26 22:46:46,662 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 2 times [2019-12-26 22:46:46,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:46,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494988329] [2019-12-26 22:46:46,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:46,802 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 22:46:46,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494988329] [2019-12-26 22:46:46,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:46,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:46:46,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031838794] [2019-12-26 22:46:46,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:46:46,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:46:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:46:46,806 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 6 states. [2019-12-26 22:46:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:46,900 INFO L93 Difference]: Finished difference Result 985 states and 2333 transitions. [2019-12-26 22:46:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:46:46,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 22:46:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:46,901 INFO L225 Difference]: With dead ends: 985 [2019-12-26 22:46:46,902 INFO L226 Difference]: Without dead ends: 264 [2019-12-26 22:46:46,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:46:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-26 22:46:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-12-26 22:46:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-26 22:46:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-26 22:46:46,906 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-26 22:46:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:46,906 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-26 22:46:46,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:46:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-26 22:46:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:46,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:46,908 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] [2019-12-26 22:46:46,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 3 times [2019-12-26 22:46:46,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:46,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793999246] [2019-12-26 22:46:46,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:47,210 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 22:46:47,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793999246] [2019-12-26 22:46:47,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:47,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:46:47,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842696105] [2019-12-26 22:46:47,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:46:47,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:47,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:46:47,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:46:47,212 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 13 states. [2019-12-26 22:46:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:47,901 INFO L93 Difference]: Finished difference Result 386 states and 663 transitions. [2019-12-26 22:46:47,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:46:47,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:46:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:47,902 INFO L225 Difference]: With dead ends: 386 [2019-12-26 22:46:47,902 INFO L226 Difference]: Without dead ends: 358 [2019-12-26 22:46:47,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:46:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-26 22:46:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2019-12-26 22:46:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-26 22:46:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-26 22:46:47,908 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-26 22:46:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:47,908 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-26 22:46:47,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:46:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-26 22:46:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:47,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:47,909 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] [2019-12-26 22:46:47,910 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 4 times [2019-12-26 22:46:47,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:47,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191382494] [2019-12-26 22:46:47,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:48,145 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 22:46:48,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191382494] [2019-12-26 22:46:48,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:48,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:46:48,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134401456] [2019-12-26 22:46:48,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:46:48,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:48,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:46:48,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:46:48,152 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 13 states. [2019-12-26 22:46:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:48,643 INFO L93 Difference]: Finished difference Result 442 states and 749 transitions. [2019-12-26 22:46:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:46:48,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:46:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:48,644 INFO L225 Difference]: With dead ends: 442 [2019-12-26 22:46:48,645 INFO L226 Difference]: Without dead ends: 414 [2019-12-26 22:46:48,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:46:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-26 22:46:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2019-12-26 22:46:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-26 22:46:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-26 22:46:48,651 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-26 22:46:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:48,651 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-26 22:46:48,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:46:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-26 22:46:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:48,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:48,653 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] [2019-12-26 22:46:48,653 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 5 times [2019-12-26 22:46:48,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:48,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068664231] [2019-12-26 22:46:48,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:46:48,854 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 22:46:48,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068664231] [2019-12-26 22:46:48,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:46:48,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:46:48,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288885745] [2019-12-26 22:46:48,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:46:48,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:46:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:46:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:46:48,857 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 12 states. [2019-12-26 22:46:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:46:49,189 INFO L93 Difference]: Finished difference Result 430 states and 728 transitions. [2019-12-26 22:46:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:46:49,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-26 22:46:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:46:49,190 INFO L225 Difference]: With dead ends: 430 [2019-12-26 22:46:49,190 INFO L226 Difference]: Without dead ends: 402 [2019-12-26 22:46:49,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:46:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-12-26 22:46:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 340. [2019-12-26 22:46:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-26 22:46:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-26 22:46:49,196 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-26 22:46:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:46:49,196 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-26 22:46:49,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:46:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-26 22:46:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:46:49,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:46:49,198 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] [2019-12-26 22:46:49,198 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:46:49,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:46:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 6 times [2019-12-26 22:46:49,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:46:49,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088122367] [2019-12-26 22:46:49,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:46:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:46:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:46:49,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:46:49,332 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:46:49,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$w_buff0~0_376 0) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1273~0.base_21|) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (= |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21| 1)) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21|) |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0)) |v_#memory_int_23|) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1273~0.base_21| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_23|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1273~0.offset=|v_ULTIMATE.start_main_~#t1273~0.offset_17|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_18|, ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1273~0.base=|v_ULTIMATE.start_main_~#t1273~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1273~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1276~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1275~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1275~0.offset, ULTIMATE.start_main_~#t1274~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1273~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:46:49,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1274~0.base_13| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13|) |v_ULTIMATE.start_main_~#t1274~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t1274~0.offset_11| 0) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1274~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1274~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.offset, ULTIMATE.start_main_~#t1274~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 22:46:49,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1275~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1275~0.base_11|) (= |v_ULTIMATE.start_main_~#t1275~0.offset_10| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11|) 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1275~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11|) |v_ULTIMATE.start_main_~#t1275~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_11|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1275~0.base, ULTIMATE.start_main_~#t1275~0.offset] because there is no mapped edge [2019-12-26 22:46:49,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1276~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13| 1) |v_#valid_46|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1276~0.base_13|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1276~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13|) |v_ULTIMATE.start_main_~#t1276~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1276~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_13|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1276~0.base, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.offset] because there is no mapped edge [2019-12-26 22:46:49,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:46:49,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:46:49,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:46:49,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-58222568 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-58222568 256) 0))) (or (and (= ~z$w_buff0_used~0_In-58222568 |P3Thread1of1ForFork3_#t~ite11_Out-58222568|) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out-58222568| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-58222568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-58222568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-58222568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-58222568, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-58222568|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:46:49,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1828422873 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1828422873 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1828422873 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1828422873 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1828422873|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1828422873 |P3Thread1of1ForFork3_#t~ite12_Out-1828422873|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1828422873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1828422873, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1828422873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1828422873} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1828422873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1828422873, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1828422873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1828422873, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1828422873|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:46:49,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1471021188 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1471021188 256) 0))) (or (and (= ~z$w_buff1~0_In1471021188 |P2Thread1of1ForFork2_#t~ite3_Out1471021188|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In1471021188 |P2Thread1of1ForFork2_#t~ite3_Out1471021188|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1471021188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1471021188, ~z$w_buff1~0=~z$w_buff1~0_In1471021188, ~z~0=~z~0_In1471021188} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1471021188|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1471021188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1471021188, ~z$w_buff1~0=~z$w_buff1~0_In1471021188, ~z~0=~z~0_In1471021188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:46:49,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:46:49,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In439098622 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In439098622 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In439098622 |P2Thread1of1ForFork2_#t~ite5_Out439098622|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out439098622|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In439098622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In439098622} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out439098622|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In439098622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In439098622} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:46:49,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-533790345 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-533790345 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-533790345 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-533790345 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-533790345| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite6_Out-533790345| ~z$w_buff1_used~0_In-533790345) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-533790345, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-533790345, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-533790345, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-533790345} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-533790345|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-533790345, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-533790345, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-533790345, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-533790345} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:46:49,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1958994571 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1958994571 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1958994571|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1958994571| ~z$r_buff0_thd3~0_In1958994571)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1958994571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1958994571} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1958994571, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1958994571, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1958994571|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:46:49,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1146940605 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1146940605 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1146940605 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1146940605 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1146940605 |P2Thread1of1ForFork2_#t~ite8_Out-1146940605|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1146940605| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1146940605, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1146940605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1146940605, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1146940605} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1146940605, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1146940605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1146940605, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1146940605, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1146940605|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:46:49,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:46:49,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-75100517 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-75100517 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-75100517 ~z$r_buff0_thd4~0_In-75100517) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-75100517 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-75100517, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-75100517} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-75100517, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-75100517, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-75100517|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:46:49,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-581990366 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-581990366 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-581990366 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-581990366 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-581990366| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out-581990366| ~z$r_buff1_thd4~0_In-581990366)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-581990366, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-581990366, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-581990366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-581990366} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-581990366, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-581990366, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-581990366|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-581990366, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-581990366} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:46:49,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:46:49,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 22:46:49,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-912244423 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite20_Out-912244423| |ULTIMATE.start_main_#t~ite19_Out-912244423|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-912244423 256)))) (or (and .cse0 (= ~z~0_In-912244423 |ULTIMATE.start_main_#t~ite19_Out-912244423|) (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In-912244423 |ULTIMATE.start_main_#t~ite19_Out-912244423|) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-912244423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912244423, ~z$w_buff1~0=~z$w_buff1~0_In-912244423, ~z~0=~z~0_In-912244423} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-912244423|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-912244423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912244423, ~z$w_buff1~0=~z$w_buff1~0_In-912244423, ~z~0=~z~0_In-912244423, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-912244423|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:46:49,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1474530262 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1474530262 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1474530262|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1474530262| ~z$w_buff0_used~0_In1474530262)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1474530262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1474530262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1474530262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1474530262, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1474530262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:46:49,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1178771253 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1178771253 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1178771253 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1178771253 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1178771253|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1178771253 |ULTIMATE.start_main_#t~ite22_Out-1178771253|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178771253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178771253, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1178771253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1178771253} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178771253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178771253, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1178771253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1178771253, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1178771253|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:46:49,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-860932212 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-860932212 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out-860932212|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-860932212 |ULTIMATE.start_main_#t~ite23_Out-860932212|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860932212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860932212} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-860932212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-860932212, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-860932212|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:46:49,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In547100289 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In547100289 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In547100289 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In547100289 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out547100289| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out547100289| ~z$r_buff1_thd0~0_In547100289) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In547100289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In547100289, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In547100289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In547100289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In547100289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In547100289, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In547100289, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out547100289|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In547100289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:46:49,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In261756552 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In261756552 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In261756552 256)) .cse0) (= (mod ~z$w_buff0_used~0_In261756552 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In261756552 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite30_Out261756552| ~z$w_buff0~0_In261756552) (= |ULTIMATE.start_main_#t~ite30_Out261756552| |ULTIMATE.start_main_#t~ite31_Out261756552|) .cse1) (and (= ~z$w_buff0~0_In261756552 |ULTIMATE.start_main_#t~ite31_Out261756552|) (not .cse1) (= |ULTIMATE.start_main_#t~ite30_In261756552| |ULTIMATE.start_main_#t~ite30_Out261756552|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In261756552, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In261756552|, ~z$w_buff0~0=~z$w_buff0~0_In261756552, ~z$w_buff0_used~0=~z$w_buff0_used~0_In261756552, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In261756552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In261756552, ~weak$$choice2~0=~weak$$choice2~0_In261756552} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In261756552, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out261756552|, ~z$w_buff0~0=~z$w_buff0~0_In261756552, ~z$w_buff0_used~0=~z$w_buff0_used~0_In261756552, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In261756552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In261756552, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out261756552|, ~weak$$choice2~0=~weak$$choice2~0_In261756552} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-26 22:46:49,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In922850176 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out922850176| ~z$w_buff1~0_In922850176) (= |ULTIMATE.start_main_#t~ite33_In922850176| |ULTIMATE.start_main_#t~ite33_Out922850176|)) (and (= |ULTIMATE.start_main_#t~ite33_Out922850176| ~z$w_buff1~0_In922850176) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In922850176 256)))) (or (= (mod ~z$w_buff0_used~0_In922850176 256) 0) (and (= (mod ~z$r_buff1_thd0~0_In922850176 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In922850176 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite34_Out922850176| |ULTIMATE.start_main_#t~ite33_Out922850176|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In922850176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922850176, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In922850176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922850176, ~z$w_buff1~0=~z$w_buff1~0_In922850176, ~weak$$choice2~0=~weak$$choice2~0_In922850176, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In922850176|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In922850176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In922850176, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In922850176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922850176, ~z$w_buff1~0=~z$w_buff1~0_In922850176, ~weak$$choice2~0=~weak$$choice2~0_In922850176, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out922850176|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out922850176|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-26 22:46:49,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:46:49,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2144195329 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-2144195329| ~z$r_buff1_thd0~0_In-2144195329) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-2144195329| |ULTIMATE.start_main_#t~ite45_Out-2144195329|)) (and (= |ULTIMATE.start_main_#t~ite46_Out-2144195329| |ULTIMATE.start_main_#t~ite45_Out-2144195329|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2144195329 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-2144195329 256)) (and (= (mod ~z$w_buff1_used~0_In-2144195329 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-2144195329 256) 0)))) (= |ULTIMATE.start_main_#t~ite45_Out-2144195329| ~z$r_buff1_thd0~0_In-2144195329) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144195329, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144195329, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144195329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144195329, ~weak$$choice2~0=~weak$$choice2~0_In-2144195329, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-2144195329|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144195329, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144195329, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144195329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144195329, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2144195329|, ~weak$$choice2~0=~weak$$choice2~0_In-2144195329, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2144195329|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:46:49,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:46:49,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:46:49,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:46:49 BasicIcfg [2019-12-26 22:46:49,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:46:49,516 INFO L168 Benchmark]: Toolchain (without parser) took 31433.23 ms. Allocated memory was 142.1 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 98.1 MB in the beginning and 658.8 MB in the end (delta: -560.7 MB). Peak memory consumption was 803.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,520 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.68 ms. Allocated memory was 142.1 MB in the beginning and 198.7 MB in the end (delta: 56.6 MB). Free memory was 97.7 MB in the beginning and 151.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.04 ms. Allocated memory is still 198.7 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,524 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 198.7 MB. Free memory was 148.7 MB in the beginning and 145.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,524 INFO L168 Benchmark]: RCFGBuilder took 840.96 ms. Allocated memory is still 198.7 MB. Free memory was 145.8 MB in the beginning and 96.6 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,525 INFO L168 Benchmark]: TraceAbstraction took 29641.24 ms. Allocated memory was 198.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.6 MB in the beginning and 658.8 MB in the end (delta: -562.2 MB). Peak memory consumption was 745.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:46:49,532 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.23 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.68 ms. Allocated memory was 142.1 MB in the beginning and 198.7 MB in the end (delta: 56.6 MB). Free memory was 97.7 MB in the beginning and 151.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.04 ms. Allocated memory is still 198.7 MB. Free memory was 151.5 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 198.7 MB. Free memory was 148.7 MB in the beginning and 145.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.96 ms. Allocated memory is still 198.7 MB. Free memory was 145.8 MB in the beginning and 96.6 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29641.24 ms. Allocated memory was 198.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 96.6 MB in the beginning and 658.8 MB in the end (delta: -562.2 MB). Peak memory consumption was 745.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1273, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L833] FCALL, FORK 0 pthread_create(&t1274, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L835] FCALL, FORK 0 pthread_create(&t1275, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1276, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 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 [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 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) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2009 SDtfs, 2349 SDslu, 5459 SDs, 0 SdLazy, 3221 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 39 SyntacticMatches, 17 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 8.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 9697 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 187570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...