/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:40:55,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:40:55,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:40:55,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:40:55,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:40:55,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:40:55,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:40:55,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:40:55,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:40:55,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:40:55,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:40:55,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:40:55,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:40:55,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:40:55,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:40:55,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:40:55,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:40:55,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:40:55,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:40:55,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:40:55,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:40:55,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:40:55,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:40:55,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:40:55,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:40:55,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:40:55,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:40:55,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:40:55,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:40:55,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:40:55,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:40:55,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:40:55,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:40:55,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:40:55,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:40:55,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:40:55,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:40:55,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:40:55,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:40:55,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:40:55,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:40:55,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:40:55,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:40:55,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:40:55,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:40:55,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:40:55,782 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:40:55,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:40:55,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:40:55,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:40:55,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:40:55,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:40:55,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:40:55,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:40:55,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:40:55,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:40:55,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:40:55,786 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:40:55,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:40:55,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:40:55,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:40:55,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:40:55,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:40:55,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:40:55,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:40:55,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:40:55,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:40:55,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:40:55,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:40:55,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:40:55,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:40:55,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:40:56,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:40:56,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:40:56,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:40:56,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:40:56,139 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:40:56,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-18 13:40:56,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2559299f7/d332ddf2552e4d9a9b97f84d0ea864a3/FLAG192c4fb9c [2019-12-18 13:40:56,787 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:40:56,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-18 13:40:56,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2559299f7/d332ddf2552e4d9a9b97f84d0ea864a3/FLAG192c4fb9c [2019-12-18 13:40:57,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2559299f7/d332ddf2552e4d9a9b97f84d0ea864a3 [2019-12-18 13:40:57,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:40:57,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:40:57,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:40:57,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:40:57,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:40:57,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57, skipping insertion in model container [2019-12-18 13:40:57,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:40:57,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:40:57,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:40:57,614 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:40:57,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:40:57,760 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:40:57,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57 WrapperNode [2019-12-18 13:40:57,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:40:57,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:40:57,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:40:57,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:40:57,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:40:57,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:40:57,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:40:57,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:40:57,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... [2019-12-18 13:40:57,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:40:57,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:40:57,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:40:57,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:40:57,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:40:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:40:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:40:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:40:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:40:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:40:57,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:40:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:40:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:40:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:40:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:40:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:40:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:40:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:40:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:40:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:40:57,961 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:40:58,710 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:40:58,711 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:40:58,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:40:58 BoogieIcfgContainer [2019-12-18 13:40:58,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:40:58,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:40:58,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:40:58,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:40:58,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:40:57" (1/3) ... [2019-12-18 13:40:58,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb57a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:40:58, skipping insertion in model container [2019-12-18 13:40:58,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:40:57" (2/3) ... [2019-12-18 13:40:58,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb57a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:40:58, skipping insertion in model container [2019-12-18 13:40:58,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:40:58" (3/3) ... [2019-12-18 13:40:58,721 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2019-12-18 13:40:58,732 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:40:58,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:40:58,740 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:40:58,741 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:40:58,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,816 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,817 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,817 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,819 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,820 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,821 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,822 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,823 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,825 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,825 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,825 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,825 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,833 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,833 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,847 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,847 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:40:58,861 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:40:58,880 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:40:58,880 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:40:58,881 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:40:58,881 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:40:58,881 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:40:58,881 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:40:58,881 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:40:58,881 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:40:58,899 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-18 13:40:58,900 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:40:58,989 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:40:58,989 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:40:59,008 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. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:40:59,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-18 13:40:59,081 INFO L126 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-18 13:40:59,082 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:40:59,088 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. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:40:59,105 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:40:59,106 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:41:04,181 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 13:41:04,322 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 13:41:04,386 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-18 13:41:04,386 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 13:41:04,390 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-18 13:41:06,813 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-18 13:41:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-18 13:41:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:41:06,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:06,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:41:06,824 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-18 13:41:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-18 13:41:06,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:06,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864383638] [2019-12-18 13:41:06,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:07,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864383638] [2019-12-18 13:41:07,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:07,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:41:07,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958501612] [2019-12-18 13:41:07,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:41:07,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:41:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:07,140 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-18 13:41:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:08,430 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-18 13:41:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:41:08,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:41:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:08,753 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 13:41:08,753 INFO L226 Difference]: Without dead ends: 33638 [2019-12-18 13:41:08,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-18 13:41:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-18 13:41:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-18 13:41:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-18 13:41:10,825 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-18 13:41:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:10,827 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-18 13:41:10,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:41:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-18 13:41:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:41:10,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:10,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:41:10,843 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-18 13:41:10,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:10,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-18 13:41:10,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:10,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357324272] [2019-12-18 13:41:10,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:11,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357324272] [2019-12-18 13:41:11,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:11,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:41:11,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399909023] [2019-12-18 13:41:11,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:41:11,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:41:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:41:11,018 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-18 13:41:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:13,400 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-18 13:41:13,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:41:13,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:41:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:13,619 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 13:41:13,619 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 13:41:13,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:41:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 13:41:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-18 13:41:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-18 13:41:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-18 13:41:15,603 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-18 13:41:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:15,603 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-18 13:41:15,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:41:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-18 13:41:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:41:15,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:15,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:41:15,606 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-18 13:41:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-18 13:41:15,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:15,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059488526] [2019-12-18 13:41:15,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:15,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059488526] [2019-12-18 13:41:15,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:15,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:41:15,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474979493] [2019-12-18 13:41:15,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:41:15,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:41:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:15,666 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-18 13:41:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:15,891 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-18 13:41:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:41:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:41:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:16,027 INFO L225 Difference]: With dead ends: 37462 [2019-12-18 13:41:16,028 INFO L226 Difference]: Without dead ends: 37462 [2019-12-18 13:41:16,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-18 13:41:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-18 13:41:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-18 13:41:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-18 13:41:19,209 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-18 13:41:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:19,209 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-18 13:41:19,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:41:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-18 13:41:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:41:19,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:19,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:41:19,213 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-18 13:41:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-18 13:41:19,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:19,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180249498] [2019-12-18 13:41:19,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:19,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180249498] [2019-12-18 13:41:19,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:19,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:41:19,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276460890] [2019-12-18 13:41:19,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:41:19,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:41:19,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:41:19,282 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-18 13:41:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:19,349 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-18 13:41:19,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:41:19,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:41:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:19,383 INFO L225 Difference]: With dead ends: 15610 [2019-12-18 13:41:19,383 INFO L226 Difference]: Without dead ends: 15610 [2019-12-18 13:41:19,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:41:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-18 13:41:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-18 13:41:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-18 13:41:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-18 13:41:19,742 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-18 13:41:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:19,742 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-18 13:41:19,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:41:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-18 13:41:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:41:19,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:19,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:41:19,745 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-18 13:41:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-18 13:41:19,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:19,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846122439] [2019-12-18 13:41:19,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:19,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846122439] [2019-12-18 13:41:19,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:19,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:41:19,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738701208] [2019-12-18 13:41:19,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:41:19,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:19,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:41:19,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:41:19,790 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-18 13:41:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:19,828 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-18 13:41:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:41:19,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:41:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:19,833 INFO L225 Difference]: With dead ends: 2718 [2019-12-18 13:41:19,833 INFO L226 Difference]: Without dead ends: 2718 [2019-12-18 13:41:19,834 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-18 13:41:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-18 13:41:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-18 13:41:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-18 13:41:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-18 13:41:19,874 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-18 13:41:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:19,874 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-18 13:41:19,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:41:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-18 13:41:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:41:19,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:19,879 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-18 13:41:19,879 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-18 13:41:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-18 13:41:19,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:19,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128667140] [2019-12-18 13:41:19,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:19,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128667140] [2019-12-18 13:41:19,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:19,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:41:19,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865960726] [2019-12-18 13:41:19,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:41:19,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:41:19,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:41:19,989 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-18 13:41:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:20,037 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-18 13:41:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:41:20,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:41:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:20,041 INFO L225 Difference]: With dead ends: 1354 [2019-12-18 13:41:20,041 INFO L226 Difference]: Without dead ends: 1354 [2019-12-18 13:41:20,041 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-18 13:41:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-18 13:41:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-18 13:41:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 13:41:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-18 13:41:20,066 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-18 13:41:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:20,066 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-18 13:41:20,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:41:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-18 13:41:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:41:20,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:20,082 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-18 13:41:20,082 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-18 13:41:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-18 13:41:20,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:20,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469870284] [2019-12-18 13:41:20,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:20,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469870284] [2019-12-18 13:41:20,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:20,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:41:20,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171872795] [2019-12-18 13:41:20,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:41:20,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:41:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:20,217 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-18 13:41:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:20,257 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-18 13:41:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:41:20,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:41:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:20,260 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 13:41:20,261 INFO L226 Difference]: Without dead ends: 1222 [2019-12-18 13:41:20,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-18 13:41:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-18 13:41:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 13:41:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-18 13:41:20,281 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-18 13:41:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:20,284 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-18 13:41:20,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:41:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-18 13:41:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:41:20,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:20,287 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-18 13:41:20,288 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-18 13:41:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-18 13:41:20,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:20,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288837750] [2019-12-18 13:41:20,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:20,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288837750] [2019-12-18 13:41:20,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:20,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:41:20,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959297066] [2019-12-18 13:41:20,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:41:20,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:41:20,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:20,409 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 3 states. [2019-12-18 13:41:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:20,426 INFO L93 Difference]: Finished difference Result 1165 states and 3279 transitions. [2019-12-18 13:41:20,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:41:20,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:41:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:20,430 INFO L225 Difference]: With dead ends: 1165 [2019-12-18 13:41:20,430 INFO L226 Difference]: Without dead ends: 1165 [2019-12-18 13:41:20,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-18 13:41:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2019-12-18 13:41:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-12-18 13:41:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 3279 transitions. [2019-12-18 13:41:20,448 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 3279 transitions. Word has length 58 [2019-12-18 13:41:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:20,449 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 3279 transitions. [2019-12-18 13:41:20,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:41:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 3279 transitions. [2019-12-18 13:41:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:41:20,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:20,453 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-18 13:41:20,454 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-18 13:41:20,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:20,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1714711898, now seen corresponding path program 1 times [2019-12-18 13:41:20,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:20,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733501395] [2019-12-18 13:41:20,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:21,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733501395] [2019-12-18 13:41:21,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:21,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:41:21,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560075776] [2019-12-18 13:41:21,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:41:21,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:41:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:41:21,036 INFO L87 Difference]: Start difference. First operand 1165 states and 3279 transitions. Second operand 6 states. [2019-12-18 13:41:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:21,358 INFO L93 Difference]: Finished difference Result 1866 states and 5249 transitions. [2019-12-18 13:41:21,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:41:21,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 13:41:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:21,361 INFO L225 Difference]: With dead ends: 1866 [2019-12-18 13:41:21,362 INFO L226 Difference]: Without dead ends: 1866 [2019-12-18 13:41:21,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:41:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-12-18 13:41:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1481. [2019-12-18 13:41:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-18 13:41:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 4187 transitions. [2019-12-18 13:41:21,391 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 4187 transitions. Word has length 59 [2019-12-18 13:41:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:21,393 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 4187 transitions. [2019-12-18 13:41:21,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:41:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 4187 transitions. [2019-12-18 13:41:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:41:21,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:21,399 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-18 13:41:21,399 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-18 13:41:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -240075320, now seen corresponding path program 2 times [2019-12-18 13:41:21,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:21,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057178263] [2019-12-18 13:41:21,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:21,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057178263] [2019-12-18 13:41:21,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:21,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:41:21,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960592995] [2019-12-18 13:41:21,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:41:21,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:41:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:41:21,783 INFO L87 Difference]: Start difference. First operand 1481 states and 4187 transitions. Second operand 13 states. [2019-12-18 13:41:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:22,848 INFO L93 Difference]: Finished difference Result 3524 states and 9271 transitions. [2019-12-18 13:41:22,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:41:22,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-18 13:41:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:22,853 INFO L225 Difference]: With dead ends: 3524 [2019-12-18 13:41:22,853 INFO L226 Difference]: Without dead ends: 2535 [2019-12-18 13:41:22,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:41:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2019-12-18 13:41:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 1481. [2019-12-18 13:41:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-18 13:41:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 4157 transitions. [2019-12-18 13:41:22,881 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 4157 transitions. Word has length 59 [2019-12-18 13:41:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:22,881 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 4157 transitions. [2019-12-18 13:41:22,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:41:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 4157 transitions. [2019-12-18 13:41:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:41:22,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:22,886 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-18 13:41:22,886 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-18 13:41:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:22,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2057740932, now seen corresponding path program 3 times [2019-12-18 13:41:22,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:22,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803116054] [2019-12-18 13:41:22,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:23,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803116054] [2019-12-18 13:41:23,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:23,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:41:23,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471191319] [2019-12-18 13:41:23,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:41:23,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:41:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:41:23,015 INFO L87 Difference]: Start difference. First operand 1481 states and 4157 transitions. Second operand 6 states. [2019-12-18 13:41:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:23,105 INFO L93 Difference]: Finished difference Result 2593 states and 6651 transitions. [2019-12-18 13:41:23,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:41:23,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 13:41:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:23,108 INFO L225 Difference]: With dead ends: 2593 [2019-12-18 13:41:23,109 INFO L226 Difference]: Without dead ends: 1495 [2019-12-18 13:41:23,109 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-18 13:41:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-12-18 13:41:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1123. [2019-12-18 13:41:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-18 13:41:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2768 transitions. [2019-12-18 13:41:23,126 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2768 transitions. Word has length 59 [2019-12-18 13:41:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:23,127 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 2768 transitions. [2019-12-18 13:41:23,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:41:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2768 transitions. [2019-12-18 13:41:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:41:23,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:23,129 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-18 13:41:23,129 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-18 13:41:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1752832322, now seen corresponding path program 4 times [2019-12-18 13:41:23,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:23,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059639264] [2019-12-18 13:41:23,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:23,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059639264] [2019-12-18 13:41:23,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:23,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:41:23,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568393117] [2019-12-18 13:41:23,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:41:23,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:23,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:41:23,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:23,203 INFO L87 Difference]: Start difference. First operand 1123 states and 2768 transitions. Second operand 3 states. [2019-12-18 13:41:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:23,252 INFO L93 Difference]: Finished difference Result 1123 states and 2767 transitions. [2019-12-18 13:41:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:41:23,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:41:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:23,255 INFO L225 Difference]: With dead ends: 1123 [2019-12-18 13:41:23,255 INFO L226 Difference]: Without dead ends: 1123 [2019-12-18 13:41:23,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:41:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-18 13:41:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 726. [2019-12-18 13:41:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-12-18 13:41:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1781 transitions. [2019-12-18 13:41:23,269 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1781 transitions. Word has length 59 [2019-12-18 13:41:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:23,269 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1781 transitions. [2019-12-18 13:41:23,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:41:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1781 transitions. [2019-12-18 13:41:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:41:23,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:23,272 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-18 13:41:23,272 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-18 13:41:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:23,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1956609760, now seen corresponding path program 1 times [2019-12-18 13:41:23,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:23,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801863822] [2019-12-18 13:41:23,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:23,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801863822] [2019-12-18 13:41:23,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:23,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:41:23,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902327635] [2019-12-18 13:41:23,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:41:23,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:23,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:41:23,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:41:23,602 INFO L87 Difference]: Start difference. First operand 726 states and 1781 transitions. Second operand 12 states. [2019-12-18 13:41:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:24,004 INFO L93 Difference]: Finished difference Result 1330 states and 3116 transitions. [2019-12-18 13:41:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:41:24,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:41:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:24,006 INFO L225 Difference]: With dead ends: 1330 [2019-12-18 13:41:24,006 INFO L226 Difference]: Without dead ends: 919 [2019-12-18 13:41:24,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:41:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-18 13:41:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 600. [2019-12-18 13:41:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-18 13:41:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-18 13:41:24,019 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-18 13:41:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:24,019 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-18 13:41:24,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:41:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-18 13:41:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:41:24,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:24,021 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-18 13:41:24,021 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-18 13:41:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 2 times [2019-12-18 13:41:24,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:24,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471718584] [2019-12-18 13:41:24,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:24,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471718584] [2019-12-18 13:41:24,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:24,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:41:24,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998111804] [2019-12-18 13:41:24,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:41:24,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:41:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:41:24,190 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 6 states. [2019-12-18 13:41:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:24,268 INFO L93 Difference]: Finished difference Result 985 states and 2333 transitions. [2019-12-18 13:41:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:41:24,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:41:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:24,270 INFO L225 Difference]: With dead ends: 985 [2019-12-18 13:41:24,270 INFO L226 Difference]: Without dead ends: 264 [2019-12-18 13:41:24,271 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-18 13:41:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-18 13:41:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 232. [2019-12-18 13:41:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-18 13:41:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-18 13:41:24,274 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-18 13:41:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:24,275 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-18 13:41:24,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:41:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-18 13:41:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:41:24,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:24,276 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-18 13:41:24,276 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-18 13:41:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 3 times [2019-12-18 13:41:24,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:24,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531013338] [2019-12-18 13:41:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:24,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531013338] [2019-12-18 13:41:24,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:24,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:41:24,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431851283] [2019-12-18 13:41:24,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:41:24,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:41:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:41:24,602 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 14 states. [2019-12-18 13:41:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:25,246 INFO L93 Difference]: Finished difference Result 402 states and 693 transitions. [2019-12-18 13:41:25,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:41:25,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 13:41:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:25,247 INFO L225 Difference]: With dead ends: 402 [2019-12-18 13:41:25,247 INFO L226 Difference]: Without dead ends: 374 [2019-12-18 13:41:25,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:41:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-18 13:41:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2019-12-18 13:41:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 13:41:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-18 13:41:25,253 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-18 13:41:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:25,253 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-18 13:41:25,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:41:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-18 13:41:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:41:25,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:25,255 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-18 13:41:25,255 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-18 13:41:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 4 times [2019-12-18 13:41:25,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:25,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737448390] [2019-12-18 13:41:25,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:25,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737448390] [2019-12-18 13:41:25,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:25,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:41:25,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600697045] [2019-12-18 13:41:25,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:41:25,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:41:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:41:25,494 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 13 states. [2019-12-18 13:41:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:26,068 INFO L93 Difference]: Finished difference Result 442 states and 749 transitions. [2019-12-18 13:41:26,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:41:26,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:41:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:26,069 INFO L225 Difference]: With dead ends: 442 [2019-12-18 13:41:26,069 INFO L226 Difference]: Without dead ends: 414 [2019-12-18 13:41:26,070 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-18 13:41:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-18 13:41:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2019-12-18 13:41:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 13:41:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-18 13:41:26,074 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-18 13:41:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:26,074 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-18 13:41:26,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:41:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-18 13:41:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:41:26,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:26,075 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-18 13:41:26,076 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-18 13:41:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 5 times [2019-12-18 13:41:26,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:26,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14554007] [2019-12-18 13:41:26,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:41:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:41:26,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14554007] [2019-12-18 13:41:26,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:41:26,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:41:26,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927095448] [2019-12-18 13:41:26,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 13:41:26,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:41:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 13:41:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:41:26,376 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 15 states. [2019-12-18 13:41:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:41:26,929 INFO L93 Difference]: Finished difference Result 446 states and 758 transitions. [2019-12-18 13:41:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:41:26,930 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 13:41:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:41:26,931 INFO L225 Difference]: With dead ends: 446 [2019-12-18 13:41:26,931 INFO L226 Difference]: Without dead ends: 418 [2019-12-18 13:41:26,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:41:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-18 13:41:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 340. [2019-12-18 13:41:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 13:41:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-18 13:41:26,936 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-18 13:41:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:41:26,936 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-18 13:41:26,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 13:41:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-18 13:41:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:41:26,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:41:26,937 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-18 13:41:26,937 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-18 13:41:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:41:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 6 times [2019-12-18 13:41:26,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:41:26,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391157177] [2019-12-18 13:41:26,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:41:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:41:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:41:27,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:41:27,057 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:41:27,061 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|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21|) 0) (= v_~z$w_buff0~0_376 0) (= 0 |v_ULTIMATE.start_main_~#t1261~0.offset_17|) (= 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_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1261~0.base_21| 4)) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21|) |v_ULTIMATE.start_main_~#t1261~0.offset_17| 0))) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1261~0.base_21|) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= 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))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_18|, ~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|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_23|, #NULL.offset=|v_#NULL.offset_7|, 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|, ~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_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_23|, 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|, ~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|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_18|, ~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|, ~__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_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_18|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_22|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ULTIMATE.start_main_~#t1261~0.base=|v_ULTIMATE.start_main_~#t1261~0.base_21|, ~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|, ULTIMATE.start_main_~#t1261~0.offset=|v_ULTIMATE.start_main_~#t1261~0.offset_17|, #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_#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_#t~ite28, ULTIMATE.start_main_~#t1263~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1262~0.base, #NULL.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, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1264~0.offset, ~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, ~__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_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1263~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1261~0.base, ~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, ULTIMATE.start_main_~#t1261~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:41:27,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t1262~0.offset_11| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13| 1) |v_#valid_44|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1262~0.base_13|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1262~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13|) |v_ULTIMATE.start_main_~#t1262~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1262~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_13|, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1262~0.base, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 13:41:27,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1263~0.offset_10| 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11| 1) |v_#valid_40|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1263~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11|) |v_ULTIMATE.start_main_~#t1263~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1263~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1263~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_10|, #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_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1263~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1263~0.base] because there is no mapped edge [2019-12-18 13:41:27,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1264~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13|) |v_ULTIMATE.start_main_~#t1264~0.offset_11| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1264~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1264~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1264~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_13|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_~#t1264~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 13:41:27,066 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-18 13:41:27,067 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-18 13:41:27,067 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-18 13:41:27,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1040907683 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1040907683 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1040907683| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1040907683| ~z$w_buff0_used~0_In-1040907683)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1040907683, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1040907683} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1040907683, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1040907683, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1040907683|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:41:27,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-608421904 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-608421904 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-608421904 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-608421904 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-608421904| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-608421904 |P3Thread1of1ForFork3_#t~ite12_Out-608421904|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-608421904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-608421904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-608421904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-608421904} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-608421904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-608421904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-608421904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-608421904, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-608421904|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:41:27,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-529538040 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-529538040 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out-529538040| ~z$w_buff1~0_In-529538040) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-529538040 |P2Thread1of1ForFork2_#t~ite3_Out-529538040|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-529538040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-529538040, ~z$w_buff1~0=~z$w_buff1~0_In-529538040, ~z~0=~z~0_In-529538040} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-529538040|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-529538040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-529538040, ~z$w_buff1~0=~z$w_buff1~0_In-529538040, ~z~0=~z~0_In-529538040} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:41:27,072 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-18 13:41:27,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In76306837 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In76306837 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out76306837|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In76306837 |P2Thread1of1ForFork2_#t~ite5_Out76306837|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In76306837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76306837} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out76306837|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In76306837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76306837} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:41:27,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1812191599 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1812191599 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1812191599 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1812191599 256)))) (or (and (= ~z$w_buff1_used~0_In1812191599 |P2Thread1of1ForFork2_#t~ite6_Out1812191599|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out1812191599|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1812191599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1812191599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1812191599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1812191599} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1812191599|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1812191599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1812191599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1812191599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1812191599} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:41:27,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1883440570 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1883440570 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1883440570| ~z$r_buff0_thd3~0_In1883440570)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1883440570| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1883440570, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1883440570} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1883440570, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1883440570, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1883440570|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:41:27,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-755452641 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-755452641 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-755452641 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-755452641 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-755452641 |P2Thread1of1ForFork2_#t~ite8_Out-755452641|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-755452641|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-755452641, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755452641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755452641, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755452641} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-755452641, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-755452641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755452641, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-755452641, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-755452641|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:41:27,075 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-18 13:41:27,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1716209914 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1716209914 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1716209914 ~z$r_buff0_thd4~0_Out-1716209914)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1716209914) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1716209914, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1716209914} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1716209914, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1716209914, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1716209914|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:41:27,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-724128746 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-724128746 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-724128746 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-724128746 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-724128746|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-724128746| ~z$r_buff1_thd4~0_In-724128746) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-724128746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-724128746, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-724128746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-724128746} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-724128746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-724128746, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-724128746|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-724128746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-724128746} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:41:27,076 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-18 13:41:27,077 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-18 13:41:27,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite20_Out1531620184| |ULTIMATE.start_main_#t~ite19_Out1531620184|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1531620184 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1531620184 256)))) (or (and (= ~z~0_In1531620184 |ULTIMATE.start_main_#t~ite19_Out1531620184|) (or .cse0 .cse1) .cse2) (and .cse2 (not .cse1) (not .cse0) (= ~z$w_buff1~0_In1531620184 |ULTIMATE.start_main_#t~ite19_Out1531620184|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531620184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531620184, ~z$w_buff1~0=~z$w_buff1~0_In1531620184, ~z~0=~z~0_In1531620184} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1531620184|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1531620184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531620184, ~z$w_buff1~0=~z$w_buff1~0_In1531620184, ~z~0=~z~0_In1531620184, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1531620184|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:41:27,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-567046624 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-567046624 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-567046624| ~z$w_buff0_used~0_In-567046624)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-567046624|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-567046624, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-567046624} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-567046624, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-567046624, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-567046624|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:41:27,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-1241129994 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1241129994 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1241129994 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1241129994 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1241129994| 0)) (and (= ~z$w_buff1_used~0_In-1241129994 |ULTIMATE.start_main_#t~ite22_Out-1241129994|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1241129994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1241129994, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1241129994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1241129994} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1241129994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1241129994, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1241129994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1241129994, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1241129994|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:41:27,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1117764164 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1117764164 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1117764164|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1117764164 |ULTIMATE.start_main_#t~ite23_Out-1117764164|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1117764164, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117764164} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1117764164, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117764164, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1117764164|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:41:27,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-702902351 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-702902351 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-702902351 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-702902351 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-702902351| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-702902351 |ULTIMATE.start_main_#t~ite24_Out-702902351|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-702902351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-702902351, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-702902351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-702902351} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-702902351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-702902351, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-702902351, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-702902351|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-702902351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:41:27,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1747089744 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_In1747089744| |ULTIMATE.start_main_#t~ite30_Out1747089744|) (= ~z$w_buff0~0_In1747089744 |ULTIMATE.start_main_#t~ite31_Out1747089744|)) (and (= |ULTIMATE.start_main_#t~ite30_Out1747089744| ~z$w_buff0~0_In1747089744) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1747089744 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1747089744 256))) (= (mod ~z$w_buff0_used~0_In1747089744 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1747089744 256) 0)))) (= |ULTIMATE.start_main_#t~ite30_Out1747089744| |ULTIMATE.start_main_#t~ite31_Out1747089744|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1747089744, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In1747089744|, ~z$w_buff0~0=~z$w_buff0~0_In1747089744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1747089744, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1747089744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747089744, ~weak$$choice2~0=~weak$$choice2~0_In1747089744} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1747089744, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1747089744|, ~z$w_buff0~0=~z$w_buff0~0_In1747089744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1747089744, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1747089744, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747089744, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1747089744|, ~weak$$choice2~0=~weak$$choice2~0_In1747089744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-18 13:41:27,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In393281596 256) 0))) (or (and (= ~z$w_buff1~0_In393281596 |ULTIMATE.start_main_#t~ite33_Out393281596|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In393281596 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In393281596 256))) (and .cse0 (= (mod ~z$r_buff1_thd0~0_In393281596 256) 0)) (= (mod ~z$w_buff0_used~0_In393281596 256) 0))) (= |ULTIMATE.start_main_#t~ite34_Out393281596| |ULTIMATE.start_main_#t~ite33_Out393281596|) .cse1) (and (= ~z$w_buff1~0_In393281596 |ULTIMATE.start_main_#t~ite34_Out393281596|) (not .cse1) (= |ULTIMATE.start_main_#t~ite33_In393281596| |ULTIMATE.start_main_#t~ite33_Out393281596|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In393281596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In393281596, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In393281596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In393281596, ~z$w_buff1~0=~z$w_buff1~0_In393281596, ~weak$$choice2~0=~weak$$choice2~0_In393281596, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In393281596|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In393281596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In393281596, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In393281596, ~z$w_buff1_used~0=~z$w_buff1_used~0_In393281596, ~z$w_buff1~0=~z$w_buff1~0_In393281596, ~weak$$choice2~0=~weak$$choice2~0_In393281596, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out393281596|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out393281596|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:41:27,090 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-18 13:41:27,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1202714763 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_In-1202714763| |ULTIMATE.start_main_#t~ite45_Out-1202714763|) (= |ULTIMATE.start_main_#t~ite46_Out-1202714763| ~z$r_buff1_thd0~0_In-1202714763) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1202714763| ~z$r_buff1_thd0~0_In-1202714763) .cse0 (= |ULTIMATE.start_main_#t~ite46_Out-1202714763| |ULTIMATE.start_main_#t~ite45_Out-1202714763|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1202714763 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1202714763 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1202714763 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1202714763 256)))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202714763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202714763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1202714763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1202714763, ~weak$$choice2~0=~weak$$choice2~0_In-1202714763, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1202714763|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202714763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202714763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1202714763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1202714763, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1202714763|, ~weak$$choice2~0=~weak$$choice2~0_In-1202714763, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1202714763|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:41:27,092 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-18 13:41:27,092 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-18 13:41:27,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:41:27 BasicIcfg [2019-12-18 13:41:27,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:41:27,191 INFO L168 Benchmark]: Toolchain (without parser) took 30145.17 ms. Allocated memory was 141.0 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 103.8 MB in the beginning and 606.8 MB in the end (delta: -503.1 MB). Peak memory consumption was 571.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,192 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.76 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 103.6 MB in the beginning and 156.4 MB in the end (delta: -52.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.97 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,194 INFO L168 Benchmark]: Boogie Preprocessor took 40.90 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,194 INFO L168 Benchmark]: RCFGBuilder took 835.54 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 102.2 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,195 INFO L168 Benchmark]: TraceAbstraction took 28475.67 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.5 MB in the beginning and 606.8 MB in the end (delta: -505.3 MB). Peak memory consumption was 507.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:41:27,202 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 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.76 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 103.6 MB in the beginning and 156.4 MB in the end (delta: -52.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.97 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.90 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.54 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 102.2 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28475.67 ms. Allocated memory was 203.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 101.5 MB in the beginning and 606.8 MB in the end (delta: -505.3 MB). Peak memory consumption was 507.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 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.5s, 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(&t1261, ((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(&t1262, ((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(&t1263, ((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(&t1264, ((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: 28.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1777 SDtfs, 2505 SDslu, 5474 SDs, 0 SdLazy, 2651 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.7s 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: 7.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 7486 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 250811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...