/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:47:14,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:47:14,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:47:14,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:47:14,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:47:14,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:47:14,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:47:14,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:47:14,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:47:14,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:47:14,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:47:14,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:47:14,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:47:14,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:47:14,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:47:14,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:47:14,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:47:14,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:47:14,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:47:14,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:47:14,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:47:14,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:47:14,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:47:14,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:47:14,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:47:14,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:47:14,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:47:14,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:47:14,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:47:14,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:47:14,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:47:14,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:47:14,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:47:14,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:47:14,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:47:14,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:47:14,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:47:14,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:47:14,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:47:14,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:47:14,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:47:14,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 03:47:14,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:47:14,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:47:14,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:47:14,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:47:14,863 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:47:14,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:47:14,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:47:14,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:47:14,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:47:14,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:47:14,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:47:14,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:47:14,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:47:14,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:47:14,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:47:14,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:47:14,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:47:14,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:47:14,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:47:14,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:47:14,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:47:14,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:47:14,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:47:14,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:47:14,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:47:14,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:47:14,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:47:14,868 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:47:14,868 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:47:14,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:47:14,868 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:47:14,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:47:15,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:47:15,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:47:15,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:47:15,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:47:15,146 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:47:15,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i [2019-12-28 03:47:15,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd623dd8e/139c60d890a542dab76ce327a6e5322c/FLAG8a56d5322 [2019-12-28 03:47:15,820 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:47:15,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.opt.i [2019-12-28 03:47:15,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd623dd8e/139c60d890a542dab76ce327a6e5322c/FLAG8a56d5322 [2019-12-28 03:47:16,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd623dd8e/139c60d890a542dab76ce327a6e5322c [2019-12-28 03:47:16,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:47:16,135 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:47:16,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:47:16,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:47:16,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:47:16,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:47:16" (1/1) ... [2019-12-28 03:47:16,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0c9cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:16, skipping insertion in model container [2019-12-28 03:47:16,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:47:16" (1/1) ... [2019-12-28 03:47:16,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:47:16,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:47:16,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:47:16,852 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:47:16,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:47:16,999 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:47:17,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17 WrapperNode [2019-12-28 03:47:17,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:47:17,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:47:17,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:47:17,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:47:17,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:47:17,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:47:17,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:47:17,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:47:17,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (1/1) ... [2019-12-28 03:47:17,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:47:17,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:47:17,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:47:17,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:47:17,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (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-28 03:47:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:47:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:47:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:47:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:47:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:47:17,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:47:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:47:17,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:47:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:47:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:47:17,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:47:17,182 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:47:17,849 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:47:17,850 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:47:17,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:47:17 BoogieIcfgContainer [2019-12-28 03:47:17,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:47:17,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:47:17,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:47:17,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:47:17,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:47:16" (1/3) ... [2019-12-28 03:47:17,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b61fab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:47:17, skipping insertion in model container [2019-12-28 03:47:17,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:17" (2/3) ... [2019-12-28 03:47:17,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b61fab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:47:17, skipping insertion in model container [2019-12-28 03:47:17,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:47:17" (3/3) ... [2019-12-28 03:47:17,864 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.opt.i [2019-12-28 03:47:17,874 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:47:17,874 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:47:17,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:47:17,884 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:47:17,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,946 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,957 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:17,985 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:47:18,008 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:47:18,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:47:18,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:47:18,008 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:47:18,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:47:18,009 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:47:18,009 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:47:18,009 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:47:18,030 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-28 03:47:19,453 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-28 03:47:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-28 03:47:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-28 03:47:19,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:19,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:19,466 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash -503711198, now seen corresponding path program 1 times [2019-12-28 03:47:19,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:19,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025846672] [2019-12-28 03:47:19,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:19,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025846672] [2019-12-28 03:47:19,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:19,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:19,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841443302] [2019-12-28 03:47:19,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:19,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:19,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-28 03:47:19,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:19,808 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:19,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:19,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:19,822 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-28 03:47:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:21,190 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-28 03:47:21,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:47:21,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-28 03:47:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:21,386 INFO L225 Difference]: With dead ends: 26617 [2019-12-28 03:47:21,386 INFO L226 Difference]: Without dead ends: 20361 [2019-12-28 03:47:21,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-28 03:47:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-28 03:47:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-28 03:47:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-28 03:47:22,377 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-28 03:47:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:22,378 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-28 03:47:22,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-28 03:47:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:47:22,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:22,392 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] [2019-12-28 03:47:22,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:22,393 INFO L82 PathProgramCache]: Analyzing trace with hash -243116780, now seen corresponding path program 1 times [2019-12-28 03:47:22,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:22,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857531787] [2019-12-28 03:47:22,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:22,588 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-28 03:47:22,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857531787] [2019-12-28 03:47:22,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:22,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:22,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971092711] [2019-12-28 03:47:22,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:22,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:22,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:47:22,609 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:22,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:22,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:22,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:22,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:22,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:22,612 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-28 03:47:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:23,468 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-28 03:47:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:23,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 03:47:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:23,613 INFO L225 Difference]: With dead ends: 31839 [2019-12-28 03:47:23,613 INFO L226 Difference]: Without dead ends: 31287 [2019-12-28 03:47:23,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-28 03:47:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-28 03:47:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-28 03:47:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-28 03:47:25,604 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-28 03:47:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:25,606 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-28 03:47:25,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-28 03:47:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:47:25,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:25,615 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] [2019-12-28 03:47:25,615 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:25,616 INFO L82 PathProgramCache]: Analyzing trace with hash -679798597, now seen corresponding path program 1 times [2019-12-28 03:47:25,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:25,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370757960] [2019-12-28 03:47:25,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:25,926 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-28 03:47:25,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370757960] [2019-12-28 03:47:25,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:25,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:25,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857400510] [2019-12-28 03:47:25,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:25,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:25,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-28 03:47:25,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:25,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:25,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:25,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:25,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:25,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:25,952 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-12-28 03:47:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:26,555 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-28 03:47:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:26,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 03:47:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:26,733 INFO L225 Difference]: With dead ends: 38697 [2019-12-28 03:47:26,733 INFO L226 Difference]: Without dead ends: 38249 [2019-12-28 03:47:26,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-28 03:47:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-28 03:47:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-28 03:47:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-28 03:47:29,134 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-28 03:47:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:29,135 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-28 03:47:29,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-28 03:47:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 03:47:29,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:29,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:29,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash 360461205, now seen corresponding path program 1 times [2019-12-28 03:47:29,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:29,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462733421] [2019-12-28 03:47:29,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:29,196 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-28 03:47:29,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462733421] [2019-12-28 03:47:29,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:29,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:47:29,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041958731] [2019-12-28 03:47:29,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:29,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:29,217 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-28 03:47:29,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:29,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:29,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:47:29,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:47:29,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:29,220 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-12-28 03:47:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:29,788 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-28 03:47:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:47:29,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 03:47:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:29,886 INFO L225 Difference]: With dead ends: 42413 [2019-12-28 03:47:29,886 INFO L226 Difference]: Without dead ends: 42413 [2019-12-28 03:47:29,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 03:47:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-28 03:47:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-28 03:47:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-28 03:47:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-28 03:47:32,401 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-28 03:47:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:32,401 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-28 03:47:32,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:47:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-28 03:47:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:32,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:32,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:32,418 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1864507342, now seen corresponding path program 1 times [2019-12-28 03:47:32,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:32,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100538293] [2019-12-28 03:47:32,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:32,556 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-28 03:47:32,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100538293] [2019-12-28 03:47:32,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:32,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:32,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966080074] [2019-12-28 03:47:32,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:32,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:32,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-28 03:47:32,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:32,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:47:32,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:32,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:32,708 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 8 states. [2019-12-28 03:47:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:33,598 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-28 03:47:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:47:33,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 03:47:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:33,793 INFO L225 Difference]: With dead ends: 48757 [2019-12-28 03:47:33,794 INFO L226 Difference]: Without dead ends: 48237 [2019-12-28 03:47:33,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:47:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-28 03:47:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-28 03:47:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-28 03:47:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-28 03:47:35,263 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-28 03:47:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:35,263 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-28 03:47:35,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-28 03:47:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:35,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:35,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:35,289 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2007106397, now seen corresponding path program 1 times [2019-12-28 03:47:35,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:35,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290256947] [2019-12-28 03:47:35,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:35,432 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-28 03:47:35,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290256947] [2019-12-28 03:47:35,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:35,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:35,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051431974] [2019-12-28 03:47:35,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:35,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:35,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:35,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:35,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:35,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:35,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:35,451 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-12-28 03:47:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:36,500 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-28 03:47:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:36,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 03:47:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:36,689 INFO L225 Difference]: With dead ends: 53006 [2019-12-28 03:47:36,689 INFO L226 Difference]: Without dead ends: 52030 [2019-12-28 03:47:36,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-28 03:47:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-28 03:47:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-28 03:47:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-28 03:47:39,727 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-28 03:47:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:39,727 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-28 03:47:39,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-28 03:47:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:39,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:39,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:39,746 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 490909540, now seen corresponding path program 1 times [2019-12-28 03:47:39,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:39,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180183822] [2019-12-28 03:47:39,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:39,880 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-28 03:47:39,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180183822] [2019-12-28 03:47:39,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:39,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:39,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203201637] [2019-12-28 03:47:39,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:39,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:39,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:39,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:39,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:39,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:39,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:39,897 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-12-28 03:47:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:41,085 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-28 03:47:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:41,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 03:47:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:41,259 INFO L225 Difference]: With dead ends: 70898 [2019-12-28 03:47:41,259 INFO L226 Difference]: Without dead ends: 70898 [2019-12-28 03:47:41,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-28 03:47:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-28 03:47:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-28 03:47:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-28 03:47:42,821 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-28 03:47:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:42,821 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-28 03:47:42,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-28 03:47:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:42,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:42,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:42,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1378413221, now seen corresponding path program 1 times [2019-12-28 03:47:42,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:42,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262650547] [2019-12-28 03:47:42,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:42,947 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-28 03:47:42,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262650547] [2019-12-28 03:47:42,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:42,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:42,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941195177] [2019-12-28 03:47:42,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:42,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:42,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:42,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:42,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:42,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:42,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:42,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:42,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:42,971 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 4 states. [2019-12-28 03:47:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:43,025 INFO L93 Difference]: Finished difference Result 10861 states and 33396 transitions. [2019-12-28 03:47:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:43,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 03:47:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:43,039 INFO L225 Difference]: With dead ends: 10861 [2019-12-28 03:47:43,039 INFO L226 Difference]: Without dead ends: 9362 [2019-12-28 03:47:43,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:47:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9362 states. [2019-12-28 03:47:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9362 to 9314. [2019-12-28 03:47:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9314 states. [2019-12-28 03:47:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 28346 transitions. [2019-12-28 03:47:43,572 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 28346 transitions. Word has length 55 [2019-12-28 03:47:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:43,573 INFO L462 AbstractCegarLoop]: Abstraction has 9314 states and 28346 transitions. [2019-12-28 03:47:43,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 28346 transitions. [2019-12-28 03:47:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:47:43,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:43,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:43,577 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash 210347587, now seen corresponding path program 1 times [2019-12-28 03:47:43,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:43,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110003234] [2019-12-28 03:47:43,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:43,644 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-28 03:47:43,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110003234] [2019-12-28 03:47:43,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:43,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:43,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329590001] [2019-12-28 03:47:43,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:43,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:43,686 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:47:43,686 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:43,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:43,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:43,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:43,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:43,689 INFO L87 Difference]: Start difference. First operand 9314 states and 28346 transitions. Second operand 4 states. [2019-12-28 03:47:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:43,828 INFO L93 Difference]: Finished difference Result 10889 states and 33038 transitions. [2019-12-28 03:47:43,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:43,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 03:47:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:43,844 INFO L225 Difference]: With dead ends: 10889 [2019-12-28 03:47:43,844 INFO L226 Difference]: Without dead ends: 10889 [2019-12-28 03:47:43,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:47:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10889 states. [2019-12-28 03:47:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10889 to 9881. [2019-12-28 03:47:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9881 states. [2019-12-28 03:47:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 30017 transitions. [2019-12-28 03:47:43,971 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 30017 transitions. Word has length 65 [2019-12-28 03:47:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:43,971 INFO L462 AbstractCegarLoop]: Abstraction has 9881 states and 30017 transitions. [2019-12-28 03:47:43,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 30017 transitions. [2019-12-28 03:47:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:47:43,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:43,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:43,977 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:43,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1953157922, now seen corresponding path program 1 times [2019-12-28 03:47:43,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:43,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507665097] [2019-12-28 03:47:43,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:44,061 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-28 03:47:44,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507665097] [2019-12-28 03:47:44,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:44,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:44,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604311226] [2019-12-28 03:47:44,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:44,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:44,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:47:44,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:44,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:44,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:44,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:44,101 INFO L87 Difference]: Start difference. First operand 9881 states and 30017 transitions. Second operand 6 states. [2019-12-28 03:47:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:44,594 INFO L93 Difference]: Finished difference Result 12787 states and 38227 transitions. [2019-12-28 03:47:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:47:44,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-28 03:47:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:44,613 INFO L225 Difference]: With dead ends: 12787 [2019-12-28 03:47:44,613 INFO L226 Difference]: Without dead ends: 12739 [2019-12-28 03:47:44,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:47:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-12-28 03:47:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 10620. [2019-12-28 03:47:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10620 states. [2019-12-28 03:47:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10620 states to 10620 states and 32070 transitions. [2019-12-28 03:47:44,758 INFO L78 Accepts]: Start accepts. Automaton has 10620 states and 32070 transitions. Word has length 65 [2019-12-28 03:47:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:44,758 INFO L462 AbstractCegarLoop]: Abstraction has 10620 states and 32070 transitions. [2019-12-28 03:47:44,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 10620 states and 32070 transitions. [2019-12-28 03:47:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:47:44,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:44,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:44,766 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash 432491766, now seen corresponding path program 1 times [2019-12-28 03:47:44,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:44,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959961878] [2019-12-28 03:47:44,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:44,821 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-28 03:47:44,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959961878] [2019-12-28 03:47:44,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:44,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:44,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1833634218] [2019-12-28 03:47:44,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:44,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:44,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:47:44,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:44,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:44,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:44,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:44,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:44,848 INFO L87 Difference]: Start difference. First operand 10620 states and 32070 transitions. Second operand 4 states. [2019-12-28 03:47:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:45,120 INFO L93 Difference]: Finished difference Result 13322 states and 39672 transitions. [2019-12-28 03:47:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:47:45,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-28 03:47:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:45,145 INFO L225 Difference]: With dead ends: 13322 [2019-12-28 03:47:45,145 INFO L226 Difference]: Without dead ends: 13322 [2019-12-28 03:47:45,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-12-28 03:47:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 12176. [2019-12-28 03:47:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-28 03:47:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 36361 transitions. [2019-12-28 03:47:45,311 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 36361 transitions. Word has length 67 [2019-12-28 03:47:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:45,311 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 36361 transitions. [2019-12-28 03:47:45,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 36361 transitions. [2019-12-28 03:47:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:47:45,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:45,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:45,321 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:45,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:45,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1644717577, now seen corresponding path program 1 times [2019-12-28 03:47:45,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:45,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468225402] [2019-12-28 03:47:45,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:45,357 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-28 03:47:45,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468225402] [2019-12-28 03:47:45,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:45,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:47:45,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661097253] [2019-12-28 03:47:45,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:45,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:45,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:47:45,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:45,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:45,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:47:45,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:47:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:45,566 INFO L87 Difference]: Start difference. First operand 12176 states and 36361 transitions. Second operand 3 states. [2019-12-28 03:47:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:45,784 INFO L93 Difference]: Finished difference Result 12702 states and 37766 transitions. [2019-12-28 03:47:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:47:45,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-28 03:47:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:45,803 INFO L225 Difference]: With dead ends: 12702 [2019-12-28 03:47:45,803 INFO L226 Difference]: Without dead ends: 12702 [2019-12-28 03:47:45,804 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-28 03:47:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-28 03:47:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12464. [2019-12-28 03:47:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12464 states. [2019-12-28 03:47:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12464 states to 12464 states and 37125 transitions. [2019-12-28 03:47:45,974 INFO L78 Accepts]: Start accepts. Automaton has 12464 states and 37125 transitions. Word has length 67 [2019-12-28 03:47:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:45,974 INFO L462 AbstractCegarLoop]: Abstraction has 12464 states and 37125 transitions. [2019-12-28 03:47:45,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:47:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12464 states and 37125 transitions. [2019-12-28 03:47:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:45,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:45,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:45,985 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash 823928763, now seen corresponding path program 1 times [2019-12-28 03:47:45,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:45,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893391512] [2019-12-28 03:47:45,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:46,081 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-28 03:47:46,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893391512] [2019-12-28 03:47:46,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:46,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:46,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805754030] [2019-12-28 03:47:46,082 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:46,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:46,110 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:46,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:46,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:46,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:46,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:46,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:46,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:46,112 INFO L87 Difference]: Start difference. First operand 12464 states and 37125 transitions. Second operand 6 states. [2019-12-28 03:47:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:46,967 INFO L93 Difference]: Finished difference Result 23174 states and 68856 transitions. [2019-12-28 03:47:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:46,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:47:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:46,999 INFO L225 Difference]: With dead ends: 23174 [2019-12-28 03:47:46,999 INFO L226 Difference]: Without dead ends: 23174 [2019-12-28 03:47:46,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23174 states. [2019-12-28 03:47:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23174 to 16076. [2019-12-28 03:47:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16076 states. [2019-12-28 03:47:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16076 states to 16076 states and 47615 transitions. [2019-12-28 03:47:47,231 INFO L78 Accepts]: Start accepts. Automaton has 16076 states and 47615 transitions. Word has length 69 [2019-12-28 03:47:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:47,231 INFO L462 AbstractCegarLoop]: Abstraction has 16076 states and 47615 transitions. [2019-12-28 03:47:47,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16076 states and 47615 transitions. [2019-12-28 03:47:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:47,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:47,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:47,247 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash 313394586, now seen corresponding path program 1 times [2019-12-28 03:47:47,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:47,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443628592] [2019-12-28 03:47:47,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:47,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443628592] [2019-12-28 03:47:47,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:47,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:47,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666568181] [2019-12-28 03:47:47,346 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:47,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:47,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:47,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:47,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:47,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:47,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:47,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:47,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:47,369 INFO L87 Difference]: Start difference. First operand 16076 states and 47615 transitions. Second operand 6 states. [2019-12-28 03:47:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:47,929 INFO L93 Difference]: Finished difference Result 16312 states and 48080 transitions. [2019-12-28 03:47:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:47,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:47:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:47,950 INFO L225 Difference]: With dead ends: 16312 [2019-12-28 03:47:47,951 INFO L226 Difference]: Without dead ends: 16312 [2019-12-28 03:47:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16312 states. [2019-12-28 03:47:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16312 to 15788. [2019-12-28 03:47:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15788 states. [2019-12-28 03:47:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15788 states to 15788 states and 46696 transitions. [2019-12-28 03:47:48,148 INFO L78 Accepts]: Start accepts. Automaton has 15788 states and 46696 transitions. Word has length 69 [2019-12-28 03:47:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:48,148 INFO L462 AbstractCegarLoop]: Abstraction has 15788 states and 46696 transitions. [2019-12-28 03:47:48,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15788 states and 46696 transitions. [2019-12-28 03:47:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:48,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:48,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:48,161 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1253280580, now seen corresponding path program 1 times [2019-12-28 03:47:48,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:48,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630086920] [2019-12-28 03:47:48,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:48,232 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-28 03:47:48,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630086920] [2019-12-28 03:47:48,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:48,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:48,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1080756330] [2019-12-28 03:47:48,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:48,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:48,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:48,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:48,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:48,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:48,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:48,330 INFO L87 Difference]: Start difference. First operand 15788 states and 46696 transitions. Second operand 5 states. [2019-12-28 03:47:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:48,668 INFO L93 Difference]: Finished difference Result 20228 states and 59547 transitions. [2019-12-28 03:47:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:47:48,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:48,701 INFO L225 Difference]: With dead ends: 20228 [2019-12-28 03:47:48,701 INFO L226 Difference]: Without dead ends: 20228 [2019-12-28 03:47:48,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20228 states. [2019-12-28 03:47:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20228 to 15792. [2019-12-28 03:47:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2019-12-28 03:47:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 46227 transitions. [2019-12-28 03:47:48,940 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 46227 transitions. Word has length 69 [2019-12-28 03:47:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:48,940 INFO L462 AbstractCegarLoop]: Abstraction has 15792 states and 46227 transitions. [2019-12-28 03:47:48,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 46227 transitions. [2019-12-28 03:47:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:48,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:48,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:48,955 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1763814757, now seen corresponding path program 1 times [2019-12-28 03:47:48,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:48,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741370081] [2019-12-28 03:47:48,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:49,035 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-28 03:47:49,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741370081] [2019-12-28 03:47:49,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:49,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:49,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834154677] [2019-12-28 03:47:49,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:49,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:49,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:49,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:49,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:49,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:49,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:49,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:49,079 INFO L87 Difference]: Start difference. First operand 15792 states and 46227 transitions. Second operand 5 states. [2019-12-28 03:47:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:49,544 INFO L93 Difference]: Finished difference Result 20568 states and 59927 transitions. [2019-12-28 03:47:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:49,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:49,573 INFO L225 Difference]: With dead ends: 20568 [2019-12-28 03:47:49,574 INFO L226 Difference]: Without dead ends: 20568 [2019-12-28 03:47:49,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20568 states. [2019-12-28 03:47:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20568 to 16697. [2019-12-28 03:47:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-12-28 03:47:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 48872 transitions. [2019-12-28 03:47:49,810 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 48872 transitions. Word has length 69 [2019-12-28 03:47:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:49,810 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 48872 transitions. [2019-12-28 03:47:49,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 48872 transitions. [2019-12-28 03:47:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:49,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:49,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:49,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 723698076, now seen corresponding path program 1 times [2019-12-28 03:47:49,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:49,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126454876] [2019-12-28 03:47:49,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:49,882 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-28 03:47:49,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126454876] [2019-12-28 03:47:49,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:49,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:49,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055234180] [2019-12-28 03:47:49,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:49,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:49,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:49,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:49,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:49,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:49,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:49,911 INFO L87 Difference]: Start difference. First operand 16697 states and 48872 transitions. Second operand 4 states. [2019-12-28 03:47:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:50,430 INFO L93 Difference]: Finished difference Result 21470 states and 62923 transitions. [2019-12-28 03:47:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:50,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 03:47:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:50,459 INFO L225 Difference]: With dead ends: 21470 [2019-12-28 03:47:50,459 INFO L226 Difference]: Without dead ends: 21206 [2019-12-28 03:47:50,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 03:47:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21206 states. [2019-12-28 03:47:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21206 to 19805. [2019-12-28 03:47:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19805 states. [2019-12-28 03:47:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19805 states to 19805 states and 58090 transitions. [2019-12-28 03:47:50,831 INFO L78 Accepts]: Start accepts. Automaton has 19805 states and 58090 transitions. Word has length 69 [2019-12-28 03:47:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:50,831 INFO L462 AbstractCegarLoop]: Abstraction has 19805 states and 58090 transitions. [2019-12-28 03:47:50,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 19805 states and 58090 transitions. [2019-12-28 03:47:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:50,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:50,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:50,843 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1073253283, now seen corresponding path program 1 times [2019-12-28 03:47:50,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:50,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57686781] [2019-12-28 03:47:50,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:50,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57686781] [2019-12-28 03:47:50,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:50,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:47:50,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820093467] [2019-12-28 03:47:50,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:50,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:51,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:51,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:51,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:51,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:47:51,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:51,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:47:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:47:51,002 INFO L87 Difference]: Start difference. First operand 19805 states and 58090 transitions. Second operand 9 states. [2019-12-28 03:47:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:51,872 INFO L93 Difference]: Finished difference Result 24984 states and 72678 transitions. [2019-12-28 03:47:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:47:51,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-12-28 03:47:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:51,930 INFO L225 Difference]: With dead ends: 24984 [2019-12-28 03:47:51,930 INFO L226 Difference]: Without dead ends: 24984 [2019-12-28 03:47:51,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:47:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24984 states. [2019-12-28 03:47:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24984 to 21516. [2019-12-28 03:47:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21516 states. [2019-12-28 03:47:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21516 states to 21516 states and 62997 transitions. [2019-12-28 03:47:52,500 INFO L78 Accepts]: Start accepts. Automaton has 21516 states and 62997 transitions. Word has length 69 [2019-12-28 03:47:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:52,500 INFO L462 AbstractCegarLoop]: Abstraction has 21516 states and 62997 transitions. [2019-12-28 03:47:52,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:47:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21516 states and 62997 transitions. [2019-12-28 03:47:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:52,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:52,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:52,524 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash -185749602, now seen corresponding path program 1 times [2019-12-28 03:47:52,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:52,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983367030] [2019-12-28 03:47:52,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:52,645 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-28 03:47:52,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983367030] [2019-12-28 03:47:52,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:52,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:52,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589535789] [2019-12-28 03:47:52,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:52,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:52,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:52,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:52,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:52,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:52,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:52,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:52,688 INFO L87 Difference]: Start difference. First operand 21516 states and 62997 transitions. Second operand 5 states. [2019-12-28 03:47:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:52,781 INFO L93 Difference]: Finished difference Result 7041 states and 17344 transitions. [2019-12-28 03:47:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:47:52,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:52,792 INFO L225 Difference]: With dead ends: 7041 [2019-12-28 03:47:52,792 INFO L226 Difference]: Without dead ends: 5779 [2019-12-28 03:47:52,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-28 03:47:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2019-12-28 03:47:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 4906. [2019-12-28 03:47:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4906 states. [2019-12-28 03:47:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 11910 transitions. [2019-12-28 03:47:52,886 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 11910 transitions. Word has length 69 [2019-12-28 03:47:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:52,887 INFO L462 AbstractCegarLoop]: Abstraction has 4906 states and 11910 transitions. [2019-12-28 03:47:52,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 11910 transitions. [2019-12-28 03:47:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:47:52,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:52,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:52,894 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:52,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1651968936, now seen corresponding path program 1 times [2019-12-28 03:47:52,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:52,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332286206] [2019-12-28 03:47:52,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:52,964 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-28 03:47:52,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332286206] [2019-12-28 03:47:52,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:52,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:52,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [434699214] [2019-12-28 03:47:52,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:52,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:53,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 208 transitions. [2019-12-28 03:47:53,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:53,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:47:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:53,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:53,041 INFO L87 Difference]: Start difference. First operand 4906 states and 11910 transitions. Second operand 6 states. [2019-12-28 03:47:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:53,637 INFO L93 Difference]: Finished difference Result 8029 states and 19439 transitions. [2019-12-28 03:47:53,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:47:53,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-28 03:47:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:53,647 INFO L225 Difference]: With dead ends: 8029 [2019-12-28 03:47:53,647 INFO L226 Difference]: Without dead ends: 7926 [2019-12-28 03:47:53,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:47:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2019-12-28 03:47:53,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 5990. [2019-12-28 03:47:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5990 states. [2019-12-28 03:47:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 14696 transitions. [2019-12-28 03:47:53,711 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 14696 transitions. Word has length 84 [2019-12-28 03:47:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:53,712 INFO L462 AbstractCegarLoop]: Abstraction has 5990 states and 14696 transitions. [2019-12-28 03:47:53,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 14696 transitions. [2019-12-28 03:47:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:47:53,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:53,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:53,719 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash 16566106, now seen corresponding path program 2 times [2019-12-28 03:47:53,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:53,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033576479] [2019-12-28 03:47:53,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:53,810 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-28 03:47:53,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033576479] [2019-12-28 03:47:53,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:53,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:53,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436684113] [2019-12-28 03:47:53,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:53,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:53,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 218 transitions. [2019-12-28 03:47:53,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:54,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:47:54,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:54,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:54,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:54,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:54,005 INFO L87 Difference]: Start difference. First operand 5990 states and 14696 transitions. Second operand 8 states. [2019-12-28 03:47:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:54,938 INFO L93 Difference]: Finished difference Result 8972 states and 20696 transitions. [2019-12-28 03:47:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:47:54,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-28 03:47:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:54,948 INFO L225 Difference]: With dead ends: 8972 [2019-12-28 03:47:54,948 INFO L226 Difference]: Without dead ends: 8666 [2019-12-28 03:47:54,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2019-12-28 03:47:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 4777. [2019-12-28 03:47:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2019-12-28 03:47:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 11244 transitions. [2019-12-28 03:47:55,007 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 11244 transitions. Word has length 84 [2019-12-28 03:47:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:55,007 INFO L462 AbstractCegarLoop]: Abstraction has 4777 states and 11244 transitions. [2019-12-28 03:47:55,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 11244 transitions. [2019-12-28 03:47:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-28 03:47:55,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:55,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:55,012 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash -965254213, now seen corresponding path program 1 times [2019-12-28 03:47:55,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:55,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102595512] [2019-12-28 03:47:55,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:55,108 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-28 03:47:55,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102595512] [2019-12-28 03:47:55,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:55,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:55,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1849800339] [2019-12-28 03:47:55,109 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:55,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:55,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 216 transitions. [2019-12-28 03:47:55,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:55,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:55,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:55,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:55,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:55,198 INFO L87 Difference]: Start difference. First operand 4777 states and 11244 transitions. Second operand 7 states. [2019-12-28 03:47:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:55,246 INFO L93 Difference]: Finished difference Result 4633 states and 10809 transitions. [2019-12-28 03:47:55,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:47:55,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-12-28 03:47:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:55,252 INFO L225 Difference]: With dead ends: 4633 [2019-12-28 03:47:55,252 INFO L226 Difference]: Without dead ends: 4633 [2019-12-28 03:47:55,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2019-12-28 03:47:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 2698. [2019-12-28 03:47:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-12-28 03:47:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 6172 transitions. [2019-12-28 03:47:55,285 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 6172 transitions. Word has length 84 [2019-12-28 03:47:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:55,286 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 6172 transitions. [2019-12-28 03:47:55,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 6172 transitions. [2019-12-28 03:47:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:55,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:55,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:55,288 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1417025587, now seen corresponding path program 1 times [2019-12-28 03:47:55,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:55,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527606806] [2019-12-28 03:47:55,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:55,380 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-28 03:47:55,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527606806] [2019-12-28 03:47:55,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:55,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:55,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019238048] [2019-12-28 03:47:55,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:55,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:55,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:55,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:55,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:47:55,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:55,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:55,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:55,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:55,488 INFO L87 Difference]: Start difference. First operand 2698 states and 6172 transitions. Second operand 8 states. [2019-12-28 03:47:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:56,332 INFO L93 Difference]: Finished difference Result 3646 states and 8220 transitions. [2019-12-28 03:47:56,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 03:47:56,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 03:47:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:56,337 INFO L225 Difference]: With dead ends: 3646 [2019-12-28 03:47:56,337 INFO L226 Difference]: Without dead ends: 3610 [2019-12-28 03:47:56,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:47:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2019-12-28 03:47:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 2814. [2019-12-28 03:47:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2814 states. [2019-12-28 03:47:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 6403 transitions. [2019-12-28 03:47:56,369 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 6403 transitions. Word has length 86 [2019-12-28 03:47:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:56,369 INFO L462 AbstractCegarLoop]: Abstraction has 2814 states and 6403 transitions. [2019-12-28 03:47:56,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 6403 transitions. [2019-12-28 03:47:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:56,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:56,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:56,372 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:56,372 INFO L82 PathProgramCache]: Analyzing trace with hash 800732366, now seen corresponding path program 1 times [2019-12-28 03:47:56,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:56,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054034076] [2019-12-28 03:47:56,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:56,501 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-28 03:47:56,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054034076] [2019-12-28 03:47:56,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:56,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:47:56,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565772398] [2019-12-28 03:47:56,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:56,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:56,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:56,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:56,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:56,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:47:56,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:47:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:56,609 INFO L87 Difference]: Start difference. First operand 2814 states and 6403 transitions. Second operand 10 states. [2019-12-28 03:47:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:57,367 INFO L93 Difference]: Finished difference Result 3442 states and 7803 transitions. [2019-12-28 03:47:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:47:57,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-28 03:47:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:57,371 INFO L225 Difference]: With dead ends: 3442 [2019-12-28 03:47:57,371 INFO L226 Difference]: Without dead ends: 3442 [2019-12-28 03:47:57,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:47:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2019-12-28 03:47:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 2805. [2019-12-28 03:47:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-12-28 03:47:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 6380 transitions. [2019-12-28 03:47:57,402 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 6380 transitions. Word has length 86 [2019-12-28 03:47:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:57,402 INFO L462 AbstractCegarLoop]: Abstraction has 2805 states and 6380 transitions. [2019-12-28 03:47:57,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:47:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 6380 transitions. [2019-12-28 03:47:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:57,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:57,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:57,405 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1688236047, now seen corresponding path program 1 times [2019-12-28 03:47:57,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:57,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564771210] [2019-12-28 03:47:57,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:57,523 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-28 03:47:57,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564771210] [2019-12-28 03:47:57,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:57,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:57,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378232419] [2019-12-28 03:47:57,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:57,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:57,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:57,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:57,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:47:57,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:47:57,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:47:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:47:57,723 INFO L87 Difference]: Start difference. First operand 2805 states and 6380 transitions. Second operand 9 states. [2019-12-28 03:47:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:58,047 INFO L93 Difference]: Finished difference Result 5291 states and 12154 transitions. [2019-12-28 03:47:58,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:47:58,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-28 03:47:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:58,053 INFO L225 Difference]: With dead ends: 5291 [2019-12-28 03:47:58,054 INFO L226 Difference]: Without dead ends: 4471 [2019-12-28 03:47:58,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:47:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2019-12-28 03:47:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 2944. [2019-12-28 03:47:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-28 03:47:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 6741 transitions. [2019-12-28 03:47:58,088 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 6741 transitions. Word has length 86 [2019-12-28 03:47:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:58,088 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 6741 transitions. [2019-12-28 03:47:58,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:47:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 6741 transitions. [2019-12-28 03:47:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:58,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:58,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:58,091 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 766194047, now seen corresponding path program 2 times [2019-12-28 03:47:58,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:58,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372233924] [2019-12-28 03:47:58,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:58,247 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-28 03:47:58,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372233924] [2019-12-28 03:47:58,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:58,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:47:58,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733108122] [2019-12-28 03:47:58,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:58,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:58,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 254 transitions. [2019-12-28 03:47:58,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:58,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:47:58,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 03:47:58,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:58,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 03:47:58,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:58,503 INFO L87 Difference]: Start difference. First operand 2944 states and 6741 transitions. Second operand 13 states. [2019-12-28 03:48:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:48:01,824 INFO L93 Difference]: Finished difference Result 10983 states and 25420 transitions. [2019-12-28 03:48:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 03:48:01,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-28 03:48:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:48:01,833 INFO L225 Difference]: With dead ends: 10983 [2019-12-28 03:48:01,834 INFO L226 Difference]: Without dead ends: 7362 [2019-12-28 03:48:01,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2019-12-28 03:48:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2019-12-28 03:48:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 3173. [2019-12-28 03:48:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3173 states. [2019-12-28 03:48:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 7072 transitions. [2019-12-28 03:48:01,886 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 7072 transitions. Word has length 86 [2019-12-28 03:48:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:48:01,886 INFO L462 AbstractCegarLoop]: Abstraction has 3173 states and 7072 transitions. [2019-12-28 03:48:01,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 03:48:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 7072 transitions. [2019-12-28 03:48:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:48:01,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:48:01,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:48:01,889 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:48:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:48:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1023314086, now seen corresponding path program 1 times [2019-12-28 03:48:01,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:48:01,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559258587] [2019-12-28 03:48:01,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:48:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:48:02,014 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-28 03:48:02,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559258587] [2019-12-28 03:48:02,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:48:02,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:48:02,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837539107] [2019-12-28 03:48:02,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:48:02,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:48:02,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 275 transitions. [2019-12-28 03:48:02,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:48:02,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:48:02,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:48:02,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:48:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:48:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:48:02,122 INFO L87 Difference]: Start difference. First operand 3173 states and 7072 transitions. Second operand 7 states. [2019-12-28 03:48:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:48:02,269 INFO L93 Difference]: Finished difference Result 5025 states and 11323 transitions. [2019-12-28 03:48:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:48:02,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 03:48:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:48:02,274 INFO L225 Difference]: With dead ends: 5025 [2019-12-28 03:48:02,274 INFO L226 Difference]: Without dead ends: 1923 [2019-12-28 03:48:02,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:48:02,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-28 03:48:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2019-12-28 03:48:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-28 03:48:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 4358 transitions. [2019-12-28 03:48:02,317 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 4358 transitions. Word has length 86 [2019-12-28 03:48:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:48:02,318 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 4358 transitions. [2019-12-28 03:48:02,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:48:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 4358 transitions. [2019-12-28 03:48:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:48:02,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:48:02,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:48:02,323 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:48:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:48:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 644452468, now seen corresponding path program 2 times [2019-12-28 03:48:02,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:48:02,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876236517] [2019-12-28 03:48:02,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:48:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:48:02,537 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-28 03:48:02,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876236517] [2019-12-28 03:48:02,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:48:02,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:48:02,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977668276] [2019-12-28 03:48:02,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:48:02,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:48:02,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 03:48:02,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:48:02,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:48:02,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:48:02,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:48:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:48:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:48:02,810 INFO L87 Difference]: Start difference. First operand 1923 states and 4358 transitions. Second operand 11 states. [2019-12-28 03:48:04,172 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-28 03:48:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:48:04,638 INFO L93 Difference]: Finished difference Result 2623 states and 5936 transitions. [2019-12-28 03:48:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 03:48:04,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-28 03:48:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:48:04,642 INFO L225 Difference]: With dead ends: 2623 [2019-12-28 03:48:04,642 INFO L226 Difference]: Without dead ends: 2623 [2019-12-28 03:48:04,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-12-28 03:48:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2019-12-28 03:48:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 1945. [2019-12-28 03:48:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-12-28 03:48:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 4407 transitions. [2019-12-28 03:48:04,663 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 4407 transitions. Word has length 86 [2019-12-28 03:48:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:48:04,663 INFO L462 AbstractCegarLoop]: Abstraction has 1945 states and 4407 transitions. [2019-12-28 03:48:04,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:48:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 4407 transitions. [2019-12-28 03:48:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:48:04,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:48:04,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:48:04,665 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:48:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:48:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1531956149, now seen corresponding path program 3 times [2019-12-28 03:48:04,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:48:04,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718418455] [2019-12-28 03:48:04,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:48:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:48:04,823 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-28 03:48:04,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718418455] [2019-12-28 03:48:04,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:48:04,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:48:04,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465342895] [2019-12-28 03:48:04,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:48:04,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:48:04,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 03:48:04,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:48:04,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:48:04,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:48:04,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:48:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:48:04,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:48:04,904 INFO L87 Difference]: Start difference. First operand 1945 states and 4407 transitions. Second operand 10 states. [2019-12-28 03:48:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:48:05,219 INFO L93 Difference]: Finished difference Result 3617 states and 8276 transitions. [2019-12-28 03:48:05,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:48:05,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-28 03:48:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:48:05,222 INFO L225 Difference]: With dead ends: 3617 [2019-12-28 03:48:05,222 INFO L226 Difference]: Without dead ends: 2137 [2019-12-28 03:48:05,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:48:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-12-28 03:48:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1927. [2019-12-28 03:48:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2019-12-28 03:48:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 4369 transitions. [2019-12-28 03:48:05,251 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 4369 transitions. Word has length 86 [2019-12-28 03:48:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:48:05,251 INFO L462 AbstractCegarLoop]: Abstraction has 1927 states and 4369 transitions. [2019-12-28 03:48:05,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:48:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 4369 transitions. [2019-12-28 03:48:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:48:05,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:48:05,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:48:05,254 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:48:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:48:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 167637331, now seen corresponding path program 4 times [2019-12-28 03:48:05,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:48:05,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655455620] [2019-12-28 03:48:05,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:48:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:48:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:48:05,375 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:48:05,375 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:48:05,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:48:05 BasicIcfg [2019-12-28 03:48:05,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:48:05,548 INFO L168 Benchmark]: Toolchain (without parser) took 49414.07 ms. Allocated memory was 137.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 100.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 879.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:48:05,549 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 03:48:05,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.33 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.5 MB in the beginning and 157.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:48:05,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:48:05,550 INFO L168 Benchmark]: Boogie Preprocessor took 43.88 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:48:05,551 INFO L168 Benchmark]: RCFGBuilder took 747.15 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 111.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:48:05,552 INFO L168 Benchmark]: TraceAbstraction took 47693.87 ms. Allocated memory was 203.4 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 111.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 824.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:48:05,554 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.33 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.5 MB in the beginning and 157.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 155.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.88 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 747.15 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 111.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47693.87 ms. Allocated memory was 203.4 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 111.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 824.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1663; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1664; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.3s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8273 SDtfs, 10605 SDslu, 24474 SDs, 0 SdLazy, 11216 SolverSat, 534 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 130 SyntacticMatches, 14 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 79913 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2095 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1980 ConstructedInterpolants, 0 QuantifiedInterpolants, 398222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...