/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/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:08:48,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:08:48,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:08:48,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:08:48,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:08:48,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:08:48,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:08:48,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:08:48,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:08:48,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:08:48,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:08:48,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:08:48,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:08:48,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:08:48,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:08:48,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:08:48,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:08:48,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:08:48,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:08:48,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:08:48,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:08:48,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:08:48,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:08:48,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:08:48,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:08:48,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:08:48,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:08:48,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:08:48,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:08:48,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:08:48,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:08:48,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:08:48,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:08:48,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:08:48,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:08:48,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:08:48,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:08:48,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:08:48,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:08:48,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:08:48,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:08:48,741 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 15:08:48,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:08:48,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:08:48,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:08:48,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:08:48,780 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:08:48,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:08:48,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:08:48,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:08:48,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:08:48,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:08:48,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:08:48,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:08:48,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:08:48,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:08:48,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:08:48,783 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:08:48,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:08:48,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:08:48,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:08:48,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:08:48,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:08:48,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:08:48,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:08:48,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:08:48,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:08:48,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:08:48,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:08:48,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:08:48,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:08:48,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:08:49,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:08:49,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:08:49,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:08:49,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:08:49,106 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:08:49,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-18 15:08:49,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0227426c/4d954da192ee4ab7b8881c069b68e33a/FLAGb43ca6add [2019-12-18 15:08:49,764 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:08:49,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2019-12-18 15:08:49,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0227426c/4d954da192ee4ab7b8881c069b68e33a/FLAGb43ca6add [2019-12-18 15:08:50,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0227426c/4d954da192ee4ab7b8881c069b68e33a [2019-12-18 15:08:50,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:08:50,012 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:08:50,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:50,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:08:50,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:08:50,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6013c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50, skipping insertion in model container [2019-12-18 15:08:50,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:08:50,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:08:50,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:50,667 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:08:50,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:50,836 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:08:50,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50 WrapperNode [2019-12-18 15:08:50,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:50,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:50,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:08:50,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:08:50,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:50,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:08:50,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:08:50,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:08:50,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (1/1) ... [2019-12-18 15:08:50,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:08:50,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:08:50,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:08:50,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:08:50,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (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 15:08:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:08:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:08:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:08:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:08:51,032 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:08:51,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:08:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:08:51,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:08:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:08:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:08:51,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:08:51,035 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 15:08:51,740 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:08:51,740 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:08:51,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:51 BoogieIcfgContainer [2019-12-18 15:08:51,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:08:51,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:08:51,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:08:51,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:08:51,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:08:50" (1/3) ... [2019-12-18 15:08:51,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b70eedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:51, skipping insertion in model container [2019-12-18 15:08:51,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:50" (2/3) ... [2019-12-18 15:08:51,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b70eedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:51, skipping insertion in model container [2019-12-18 15:08:51,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:51" (3/3) ... [2019-12-18 15:08:51,750 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2019-12-18 15:08:51,760 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:08:51,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:08:51,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:08:51,770 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:08:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,804 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,804 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,830 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,830 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:51,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 15:08:51,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:08:51,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:08:51,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:08:51,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:08:51,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:08:51,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:08:51,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:08:51,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:08:51,903 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 15:08:51,905 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:51,976 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:51,976 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:51,991 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:52,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:52,049 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:52,050 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:52,056 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:52,071 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 15:08:52,072 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:08:56,578 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 15:08:56,686 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 15:08:56,719 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-18 15:08:56,719 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-18 15:08:56,723 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 15:08:57,253 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-18 15:08:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-18 15:08:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 15:08:57,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:57,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 15:08:57,265 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-18 15:08:57,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:57,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794062241] [2019-12-18 15:08:57,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:57,503 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 15:08:57,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794062241] [2019-12-18 15:08:57,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:57,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:08:57,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667748401] [2019-12-18 15:08:57,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:57,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:57,530 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-18 15:08:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:57,770 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-18 15:08:57,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:57,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 15:08:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:57,859 INFO L225 Difference]: With dead ends: 8560 [2019-12-18 15:08:57,860 INFO L226 Difference]: Without dead ends: 8391 [2019-12-18 15:08:57,861 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 15:08:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-18 15:08:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-18 15:08:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-18 15:08:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-18 15:08:58,360 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-18 15:08:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:58,360 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-18 15:08:58,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-18 15:08:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:58,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:58,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:58,364 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-18 15:08:58,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:58,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21271356] [2019-12-18 15:08:58,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:58,513 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 15:08:58,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21271356] [2019-12-18 15:08:58,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:58,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:58,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433778831] [2019-12-18 15:08:58,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:58,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:58,516 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-18 15:08:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:58,930 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-18 15:08:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:58,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:59,015 INFO L225 Difference]: With dead ends: 13399 [2019-12-18 15:08:59,015 INFO L226 Difference]: Without dead ends: 13392 [2019-12-18 15:08:59,016 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 15:08:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-18 15:08:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-18 15:08:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-18 15:08:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-18 15:08:59,565 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-18 15:08:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:59,565 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-18 15:08:59,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-18 15:08:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:59,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:59,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:59,569 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-18 15:08:59,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:59,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714621041] [2019-12-18 15:08:59,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:59,718 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 15:08:59,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714621041] [2019-12-18 15:08:59,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:59,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:59,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955448860] [2019-12-18 15:08:59,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:59,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:59,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:59,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:59,721 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-18 15:09:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:00,016 INFO L93 Difference]: Finished difference Result 14846 states and 46774 transitions. [2019-12-18 15:09:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:00,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:09:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:00,068 INFO L225 Difference]: With dead ends: 14846 [2019-12-18 15:09:00,068 INFO L226 Difference]: Without dead ends: 14846 [2019-12-18 15:09:00,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 15:09:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14846 states. [2019-12-18 15:09:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14846 to 13070. [2019-12-18 15:09:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13070 states. [2019-12-18 15:09:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13070 states to 13070 states and 41519 transitions. [2019-12-18 15:09:01,165 INFO L78 Accepts]: Start accepts. Automaton has 13070 states and 41519 transitions. Word has length 11 [2019-12-18 15:09:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:01,166 INFO L462 AbstractCegarLoop]: Abstraction has 13070 states and 41519 transitions. [2019-12-18 15:09:01,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13070 states and 41519 transitions. [2019-12-18 15:09:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:09:01,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:01,173 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 15:09:01,174 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 727521173, now seen corresponding path program 1 times [2019-12-18 15:09:01,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:01,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215652734] [2019-12-18 15:09:01,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:01,300 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 15:09:01,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215652734] [2019-12-18 15:09:01,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:01,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:01,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21468211] [2019-12-18 15:09:01,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:01,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:01,307 INFO L87 Difference]: Start difference. First operand 13070 states and 41519 transitions. Second operand 4 states. [2019-12-18 15:09:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:01,343 INFO L93 Difference]: Finished difference Result 1949 states and 4516 transitions. [2019-12-18 15:09:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:09:01,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 15:09:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:01,348 INFO L225 Difference]: With dead ends: 1949 [2019-12-18 15:09:01,348 INFO L226 Difference]: Without dead ends: 1663 [2019-12-18 15:09:01,349 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 15:09:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-12-18 15:09:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2019-12-18 15:09:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-12-18 15:09:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3725 transitions. [2019-12-18 15:09:01,378 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3725 transitions. Word has length 17 [2019-12-18 15:09:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:01,379 INFO L462 AbstractCegarLoop]: Abstraction has 1663 states and 3725 transitions. [2019-12-18 15:09:01,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3725 transitions. [2019-12-18 15:09:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:09:01,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:01,381 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] [2019-12-18 15:09:01,381 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1402369775, now seen corresponding path program 1 times [2019-12-18 15:09:01,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:01,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618729663] [2019-12-18 15:09:01,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:01,505 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 15:09:01,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618729663] [2019-12-18 15:09:01,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:01,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:01,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49839821] [2019-12-18 15:09:01,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:01,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:01,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:01,508 INFO L87 Difference]: Start difference. First operand 1663 states and 3725 transitions. Second operand 5 states. [2019-12-18 15:09:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:01,557 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-18 15:09:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:01,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 15:09:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:01,559 INFO L225 Difference]: With dead ends: 403 [2019-12-18 15:09:01,559 INFO L226 Difference]: Without dead ends: 357 [2019-12-18 15:09:01,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:09:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-18 15:09:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-18 15:09:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 15:09:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-18 15:09:01,565 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-18 15:09:01,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:01,565 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-18 15:09:01,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-18 15:09:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:09:01,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:01,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:01,568 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1079059862, now seen corresponding path program 1 times [2019-12-18 15:09:01,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:01,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136602014] [2019-12-18 15:09:01,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:01,657 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 15:09:01,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136602014] [2019-12-18 15:09:01,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:01,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:01,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178285322] [2019-12-18 15:09:01,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:01,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:01,660 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-18 15:09:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:01,710 INFO L93 Difference]: Finished difference Result 332 states and 605 transitions. [2019-12-18 15:09:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:01,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 15:09:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:01,712 INFO L225 Difference]: With dead ends: 332 [2019-12-18 15:09:01,712 INFO L226 Difference]: Without dead ends: 332 [2019-12-18 15:09:01,713 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 15:09:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-18 15:09:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-18 15:09:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 15:09:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 601 transitions. [2019-12-18 15:09:01,718 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 601 transitions. Word has length 52 [2019-12-18 15:09:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:01,720 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 601 transitions. [2019-12-18 15:09:01,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 601 transitions. [2019-12-18 15:09:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:09:01,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:01,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:01,724 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-18 15:09:01,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:01,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723219380] [2019-12-18 15:09:01,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:01,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723219380] [2019-12-18 15:09:01,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:01,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:09:01,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424846608] [2019-12-18 15:09:01,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:01,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:01,932 INFO L87 Difference]: Start difference. First operand 328 states and 601 transitions. Second operand 5 states. [2019-12-18 15:09:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:02,138 INFO L93 Difference]: Finished difference Result 459 states and 837 transitions. [2019-12-18 15:09:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:02,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 15:09:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:02,141 INFO L225 Difference]: With dead ends: 459 [2019-12-18 15:09:02,146 INFO L226 Difference]: Without dead ends: 459 [2019-12-18 15:09:02,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-18 15:09:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-18 15:09:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-18 15:09:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 692 transitions. [2019-12-18 15:09:02,165 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 692 transitions. Word has length 52 [2019-12-18 15:09:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:02,165 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 692 transitions. [2019-12-18 15:09:02,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 692 transitions. [2019-12-18 15:09:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:09:02,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:02,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:02,170 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-18 15:09:02,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:02,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587110477] [2019-12-18 15:09:02,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:02,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587110477] [2019-12-18 15:09:02,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:02,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:02,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107808773] [2019-12-18 15:09:02,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:02,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:02,312 INFO L87 Difference]: Start difference. First operand 375 states and 692 transitions. Second operand 6 states. [2019-12-18 15:09:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:02,630 INFO L93 Difference]: Finished difference Result 644 states and 1177 transitions. [2019-12-18 15:09:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:09:02,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 15:09:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:02,633 INFO L225 Difference]: With dead ends: 644 [2019-12-18 15:09:02,633 INFO L226 Difference]: Without dead ends: 644 [2019-12-18 15:09:02,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:09:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-18 15:09:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 405. [2019-12-18 15:09:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-18 15:09:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 752 transitions. [2019-12-18 15:09:02,641 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 752 transitions. Word has length 52 [2019-12-18 15:09:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:02,641 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 752 transitions. [2019-12-18 15:09:02,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 752 transitions. [2019-12-18 15:09:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:09:02,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:02,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:02,644 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-18 15:09:02,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:02,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613916620] [2019-12-18 15:09:02,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:02,709 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 15:09:02,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613916620] [2019-12-18 15:09:02,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:02,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:02,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456156846] [2019-12-18 15:09:02,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:02,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:02,711 INFO L87 Difference]: Start difference. First operand 405 states and 752 transitions. Second operand 3 states. [2019-12-18 15:09:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:02,725 INFO L93 Difference]: Finished difference Result 375 states and 677 transitions. [2019-12-18 15:09:02,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:02,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 15:09:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:02,727 INFO L225 Difference]: With dead ends: 375 [2019-12-18 15:09:02,727 INFO L226 Difference]: Without dead ends: 375 [2019-12-18 15:09:02,728 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 15:09:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-18 15:09:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-12-18 15:09:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-18 15:09:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 655 transitions. [2019-12-18 15:09:02,734 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 655 transitions. Word has length 52 [2019-12-18 15:09:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:02,734 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 655 transitions. [2019-12-18 15:09:02,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 655 transitions. [2019-12-18 15:09:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:09:02,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:02,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:02,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash -798948617, now seen corresponding path program 1 times [2019-12-18 15:09:02,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:02,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043840127] [2019-12-18 15:09:02,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:02,885 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 15:09:02,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043840127] [2019-12-18 15:09:02,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:02,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:02,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673548341] [2019-12-18 15:09:02,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:09:02,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:09:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:09:02,888 INFO L87 Difference]: Start difference. First operand 363 states and 655 transitions. Second operand 7 states. [2019-12-18 15:09:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:03,113 INFO L93 Difference]: Finished difference Result 502 states and 896 transitions. [2019-12-18 15:09:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:09:03,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 15:09:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:03,115 INFO L225 Difference]: With dead ends: 502 [2019-12-18 15:09:03,115 INFO L226 Difference]: Without dead ends: 502 [2019-12-18 15:09:03,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:09:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-18 15:09:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 377. [2019-12-18 15:09:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-18 15:09:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 681 transitions. [2019-12-18 15:09:03,122 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 681 transitions. Word has length 53 [2019-12-18 15:09:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:03,122 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 681 transitions. [2019-12-18 15:09:03,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:09:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 681 transitions. [2019-12-18 15:09:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:09:03,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:03,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:03,124 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:03,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1548250017, now seen corresponding path program 2 times [2019-12-18 15:09:03,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:03,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737371000] [2019-12-18 15:09:03,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:03,298 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 15:09:03,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737371000] [2019-12-18 15:09:03,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:03,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:09:03,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797744112] [2019-12-18 15:09:03,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:09:03,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:09:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:03,301 INFO L87 Difference]: Start difference. First operand 377 states and 681 transitions. Second operand 8 states. [2019-12-18 15:09:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:03,739 INFO L93 Difference]: Finished difference Result 604 states and 1070 transitions. [2019-12-18 15:09:03,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:09:03,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-18 15:09:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:03,743 INFO L225 Difference]: With dead ends: 604 [2019-12-18 15:09:03,743 INFO L226 Difference]: Without dead ends: 604 [2019-12-18 15:09:03,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-18 15:09:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 373. [2019-12-18 15:09:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-12-18 15:09:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 670 transitions. [2019-12-18 15:09:03,751 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 670 transitions. Word has length 53 [2019-12-18 15:09:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:03,752 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 670 transitions. [2019-12-18 15:09:03,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:09:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 670 transitions. [2019-12-18 15:09:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:09:03,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:03,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:03,753 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1975941905, now seen corresponding path program 3 times [2019-12-18 15:09:03,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:03,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990513935] [2019-12-18 15:09:03,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:03,860 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 15:09:03,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990513935] [2019-12-18 15:09:03,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:03,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:03,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692990893] [2019-12-18 15:09:03,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:03,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:03,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:03,928 INFO L87 Difference]: Start difference. First operand 373 states and 670 transitions. Second operand 3 states. [2019-12-18 15:09:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:03,971 INFO L93 Difference]: Finished difference Result 372 states and 668 transitions. [2019-12-18 15:09:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:03,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 15:09:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:03,973 INFO L225 Difference]: With dead ends: 372 [2019-12-18 15:09:03,973 INFO L226 Difference]: Without dead ends: 372 [2019-12-18 15:09:03,973 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 15:09:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-18 15:09:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 275. [2019-12-18 15:09:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-18 15:09:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 487 transitions. [2019-12-18 15:09:03,981 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 487 transitions. Word has length 53 [2019-12-18 15:09:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:03,982 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 487 transitions. [2019-12-18 15:09:03,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 487 transitions. [2019-12-18 15:09:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:03,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:03,983 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] [2019-12-18 15:09:03,984 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-18 15:09:03,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:03,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144685089] [2019-12-18 15:09:03,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:04,128 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 15:09:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144685089] [2019-12-18 15:09:04,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:04,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:04,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729622780] [2019-12-18 15:09:04,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:04,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:04,131 INFO L87 Difference]: Start difference. First operand 275 states and 487 transitions. Second operand 5 states. [2019-12-18 15:09:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:04,174 INFO L93 Difference]: Finished difference Result 455 states and 796 transitions. [2019-12-18 15:09:04,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:04,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 15:09:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:04,175 INFO L225 Difference]: With dead ends: 455 [2019-12-18 15:09:04,175 INFO L226 Difference]: Without dead ends: 197 [2019-12-18 15:09:04,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:09:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-18 15:09:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-12-18 15:09:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 15:09:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 335 transitions. [2019-12-18 15:09:04,179 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 335 transitions. Word has length 54 [2019-12-18 15:09:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:04,179 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 335 transitions. [2019-12-18 15:09:04,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 335 transitions. [2019-12-18 15:09:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:04,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:04,180 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] [2019-12-18 15:09:04,180 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:04,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-18 15:09:04,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:04,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23008043] [2019-12-18 15:09:04,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:04,517 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 15:09:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23008043] [2019-12-18 15:09:04,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:04,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216936834] [2019-12-18 15:09:04,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:04,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:04,519 INFO L87 Difference]: Start difference. First operand 197 states and 335 transitions. Second operand 13 states. [2019-12-18 15:09:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:05,021 INFO L93 Difference]: Finished difference Result 363 states and 608 transitions. [2019-12-18 15:09:05,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:09:05,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 15:09:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:05,022 INFO L225 Difference]: With dead ends: 363 [2019-12-18 15:09:05,022 INFO L226 Difference]: Without dead ends: 331 [2019-12-18 15:09:05,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:09:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-18 15:09:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-18 15:09:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-18 15:09:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 506 transitions. [2019-12-18 15:09:05,029 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 506 transitions. Word has length 54 [2019-12-18 15:09:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:05,029 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 506 transitions. [2019-12-18 15:09:05,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 506 transitions. [2019-12-18 15:09:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:05,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:05,031 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] [2019-12-18 15:09:05,031 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1111282689, now seen corresponding path program 3 times [2019-12-18 15:09:05,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:05,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036116602] [2019-12-18 15:09:05,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:05,246 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 15:09:05,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036116602] [2019-12-18 15:09:05,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:05,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:09:05,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945900248] [2019-12-18 15:09:05,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:09:05,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:09:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:09:05,248 INFO L87 Difference]: Start difference. First operand 297 states and 506 transitions. Second operand 12 states. [2019-12-18 15:09:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:05,625 INFO L93 Difference]: Finished difference Result 399 states and 659 transitions. [2019-12-18 15:09:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:09:05,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 15:09:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:05,627 INFO L225 Difference]: With dead ends: 399 [2019-12-18 15:09:05,627 INFO L226 Difference]: Without dead ends: 367 [2019-12-18 15:09:05,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:09:05,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-18 15:09:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 305. [2019-12-18 15:09:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-18 15:09:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 520 transitions. [2019-12-18 15:09:05,634 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 520 transitions. Word has length 54 [2019-12-18 15:09:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:05,635 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 520 transitions. [2019-12-18 15:09:05,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:09:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 520 transitions. [2019-12-18 15:09:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:09:05,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:05,636 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] [2019-12-18 15:09:05,636 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 4 times [2019-12-18 15:09:05,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:05,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478225424] [2019-12-18 15:09:05,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:05,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:09:05,737 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:09:05,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2483~0.base_19| 4)) (= v_~x$r_buff0_thd0~0_298 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19| 1)) (= 0 |v_ULTIMATE.start_main_~#t2483~0.offset_16|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19|)) (= 0 v_~x$w_buff1~0_200) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19|) |v_ULTIMATE.start_main_~#t2483~0.offset_16| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2483~0.base_19|) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_16|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_~#t2483~0.base=|v_ULTIMATE.start_main_~#t2483~0.base_19|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_20|, ULTIMATE.start_main_~#t2483~0.offset=|v_ULTIMATE.start_main_~#t2483~0.offset_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2484~0.offset, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t2483~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2483~0.offset, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 15:09:05,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2484~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2484~0.offset_9|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2484~0.base_10|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10|) |v_ULTIMATE.start_main_~#t2484~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_10|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2484~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 15:09:05,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-479447769| 1) (= |P1Thread1of1ForFork1_#in~arg.base_In-479447769| P1Thread1of1ForFork1_~arg.base_Out-479447769) (= |P1Thread1of1ForFork1_#in~arg.offset_In-479447769| P1Thread1of1ForFork1_~arg.offset_Out-479447769) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-479447769| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-479447769) (= ~x$w_buff1~0_Out-479447769 ~x$w_buff0~0_In-479447769) (= ~x$w_buff0~0_Out-479447769 2) (= ~x$w_buff0_used~0_Out-479447769 1) (= (mod ~x$w_buff1_used~0_Out-479447769 256) 0) (= ~x$w_buff0_used~0_In-479447769 ~x$w_buff1_used~0_Out-479447769)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-479447769, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-479447769|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-479447769|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-479447769} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-479447769, ~x$w_buff0~0=~x$w_buff0~0_Out-479447769, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-479447769, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-479447769|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-479447769, ~x$w_buff1~0=~x$w_buff1~0_Out-479447769, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-479447769|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-479447769|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-479447769, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-479447769} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 15:09:05,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1425325040| |P0Thread1of1ForFork0_#t~ite3_Out-1425325040|)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1425325040 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1425325040 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1425325040 |P0Thread1of1ForFork0_#t~ite3_Out-1425325040|) (not .cse1) .cse2) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1425325040| ~x~0_In-1425325040) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1425325040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1425325040, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1425325040, ~x~0=~x~0_In-1425325040} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1425325040|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1425325040|, ~x$w_buff1~0=~x$w_buff1~0_In-1425325040, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1425325040, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1425325040, ~x~0=~x~0_In-1425325040} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 15:09:05,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1451681959 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1451681959 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1451681959| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1451681959| ~x$w_buff0_used~0_In-1451681959)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1451681959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1451681959} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1451681959|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1451681959, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1451681959} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 15:09:05,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1176393322 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1176393322 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1176393322 |P0Thread1of1ForFork0_#t~ite5_Out1176393322|)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1176393322| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1176393322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1176393322} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1176393322|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1176393322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1176393322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 15:09:05,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1663725231 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1663725231 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1663725231 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1663725231 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1663725231 |P0Thread1of1ForFork0_#t~ite6_Out-1663725231|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1663725231|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1663725231, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1663725231, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1663725231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1663725231} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1663725231|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1663725231, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1663725231, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1663725231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1663725231} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 15:09:05,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-234112537 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-234112537 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-234112537|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-234112537 |P0Thread1of1ForFork0_#t~ite7_Out-234112537|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-234112537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-234112537} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-234112537, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-234112537|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-234112537} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 15:09:05,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1390433356 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1390433356 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1390433356 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1390433356 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In1390433356 |P0Thread1of1ForFork0_#t~ite8_Out1390433356|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1390433356|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1390433356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1390433356, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1390433356, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1390433356} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1390433356, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1390433356|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1390433356, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1390433356, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1390433356} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 15:09:05,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 15:09:05,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In91946314 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In91946314 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In91946314 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In91946314 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out91946314|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In91946314 |P1Thread1of1ForFork1_#t~ite12_Out91946314|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In91946314, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In91946314, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In91946314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In91946314} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In91946314, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In91946314, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out91946314|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In91946314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In91946314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 15:09:05,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In480586306 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In480586306 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out480586306 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In480586306 ~x$r_buff0_thd2~0_Out480586306)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In480586306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In480586306} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out480586306|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out480586306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In480586306} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 15:09:05,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1043067981 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1043067981 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1043067981 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1043067981 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1043067981|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-1043067981 |P1Thread1of1ForFork1_#t~ite14_Out-1043067981|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1043067981, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1043067981, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1043067981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1043067981} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1043067981, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1043067981, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1043067981, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1043067981|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1043067981} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:09:05,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 15:09:05,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:09:05,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1302029108 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1302029108 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1302029108| ~x$w_buff1~0_In1302029108) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1302029108| ~x~0_In1302029108)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1302029108, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302029108, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1302029108, ~x~0=~x~0_In1302029108} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1302029108|, ~x$w_buff1~0=~x$w_buff1~0_In1302029108, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302029108, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1302029108, ~x~0=~x~0_In1302029108} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 15:09:05,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 15:09:05,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1801101865 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1801101865 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1801101865| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1801101865 |ULTIMATE.start_main_#t~ite19_Out1801101865|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1801101865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1801101865} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1801101865, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1801101865|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1801101865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:09:05,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In581400084 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In581400084 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In581400084 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In581400084 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out581400084| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out581400084| ~x$w_buff1_used~0_In581400084)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In581400084, ~x$w_buff1_used~0=~x$w_buff1_used~0_In581400084, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In581400084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In581400084} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In581400084, ~x$w_buff1_used~0=~x$w_buff1_used~0_In581400084, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out581400084|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In581400084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In581400084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:09:05,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1422598839 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1422598839 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1422598839| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1422598839| ~x$r_buff0_thd0~0_In-1422598839) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1422598839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422598839} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1422598839, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1422598839|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422598839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:09:05,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1113553160 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1113553160 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1113553160 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1113553160 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In1113553160 |ULTIMATE.start_main_#t~ite22_Out1113553160|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1113553160|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1113553160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1113553160, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1113553160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1113553160} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1113553160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1113553160, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1113553160, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1113553160|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1113553160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:09:05,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-706387652 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-706387652| ~x$w_buff1_used~0_In-706387652) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-706387652 256)))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-706387652 256))) (= 0 (mod ~x$w_buff0_used~0_In-706387652 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In-706387652 256) 0)))) (= |ULTIMATE.start_main_#t~ite37_Out-706387652| |ULTIMATE.start_main_#t~ite38_Out-706387652|) .cse1) (and (= |ULTIMATE.start_main_#t~ite37_In-706387652| |ULTIMATE.start_main_#t~ite37_Out-706387652|) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-706387652| ~x$w_buff1_used~0_In-706387652)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-706387652, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706387652, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-706387652|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-706387652, ~weak$$choice2~0=~weak$$choice2~0_In-706387652, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706387652} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-706387652, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-706387652, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-706387652|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-706387652|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-706387652, ~weak$$choice2~0=~weak$$choice2~0_In-706387652, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-706387652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 15:09:05,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 15:09:05,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:09:05,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:09:05,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:09:05 BasicIcfg [2019-12-18 15:09:05,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:09:05,932 INFO L168 Benchmark]: Toolchain (without parser) took 15918.41 ms. Allocated memory was 147.3 MB in the beginning and 679.0 MB in the end (delta: 531.6 MB). Free memory was 103.9 MB in the beginning and 538.1 MB in the end (delta: -434.2 MB). Peak memory consumption was 383.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:05,932 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 147.3 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:09:05,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.18 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 103.5 MB in the beginning and 159.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:05,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.80 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:05,937 INFO L168 Benchmark]: Boogie Preprocessor took 35.96 ms. Allocated memory is still 205.0 MB. Free memory was 156.6 MB in the beginning and 154.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:05,937 INFO L168 Benchmark]: RCFGBuilder took 787.73 ms. Allocated memory is still 205.0 MB. Free memory was 154.7 MB in the beginning and 110.7 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:05,941 INFO L168 Benchmark]: TraceAbstraction took 14185.95 ms. Allocated memory was 205.0 MB in the beginning and 679.0 MB in the end (delta: 474.0 MB). Free memory was 109.8 MB in the beginning and 538.1 MB in the end (delta: -428.4 MB). Peak memory consumption was 331.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:05,947 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 147.3 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.18 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 103.5 MB in the beginning and 159.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.80 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.96 ms. Allocated memory is still 205.0 MB. Free memory was 156.6 MB in the beginning and 154.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.73 ms. Allocated memory is still 205.0 MB. Free memory was 154.7 MB in the beginning and 110.7 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14185.95 ms. Allocated memory was 205.0 MB in the beginning and 679.0 MB in the end (delta: 474.0 MB). Free memory was 109.8 MB in the beginning and 538.1 MB in the end (delta: -428.4 MB). Peak memory consumption was 331.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1465 SDtfs, 1142 SDslu, 3338 SDs, 0 SdLazy, 1842 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 23 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13070occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 4304 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 108328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...