/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/podwr000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:32:50,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:32:50,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:32:50,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:32:50,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:32:50,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:32:50,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:32:50,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:32:50,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:32:50,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:32:50,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:32:50,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:32:50,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:32:50,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:32:50,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:32:50,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:32:50,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:32:50,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:32:50,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:32:50,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:32:50,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:32:50,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:32:50,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:32:50,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:32:50,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:32:50,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:32:50,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:32:50,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:32:50,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:32:50,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:32:50,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:32:50,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:32:50,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:32:50,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:32:50,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:32:50,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:32:50,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:32:50,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:32:50,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:32:50,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:32:50,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:32:50,893 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:32:50,911 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:32:50,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:32:50,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:32:50,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:32:50,914 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:32:50,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:32:50,914 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:32:50,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:32:50,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:32:50,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:32:50,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:32:50,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:32:50,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:32:50,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:32:50,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:32:50,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:32:50,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:32:50,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:32:50,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:32:50,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:32:50,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:32:50,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:32:50,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:32:50,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:32:50,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:32:50,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:32:50,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:32:50,919 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:32:50,919 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:32:50,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:32:50,921 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:32:50,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:32:51,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:32:51,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:32:51,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:32:51,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:32:51,191 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:32:51,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_rmo.oepc.i [2019-12-28 03:32:51,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab125de1/6f234502d44640709473a88b3a1d9bc7/FLAG06cde2b46 [2019-12-28 03:32:51,761 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:32:51,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_rmo.oepc.i [2019-12-28 03:32:51,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab125de1/6f234502d44640709473a88b3a1d9bc7/FLAG06cde2b46 [2019-12-28 03:32:52,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab125de1/6f234502d44640709473a88b3a1d9bc7 [2019-12-28 03:32:52,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:32:52,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:32:52,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:32:52,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:32:52,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:32:52,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52, skipping insertion in model container [2019-12-28 03:32:52,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:32:52,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:32:52,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:32:52,691 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:32:52,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:32:52,829 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:32:52,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52 WrapperNode [2019-12-28 03:32:52,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:32:52,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:32:52,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:32:52,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:32:52,840 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:32:52" (1/1) ... [2019-12-28 03:32:52,860 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:32:52" (1/1) ... [2019-12-28 03:32:52,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:32:52,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:32:52,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:32:52,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:32:52,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (1/1) ... [2019-12-28 03:32:52,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:32:52,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:32:52,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:32:52,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:32:52,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (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:32:53,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:32:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:32:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:32:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:32:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:32:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:32:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:32:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:32:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:32:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:32:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:32:53,012 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:32:53,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:32:53,713 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:32:53,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:32:53 BoogieIcfgContainer [2019-12-28 03:32:53,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:32:53,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:32:53,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:32:53,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:32:53,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:32:52" (1/3) ... [2019-12-28 03:32:53,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625fc234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:32:53, skipping insertion in model container [2019-12-28 03:32:53,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:32:52" (2/3) ... [2019-12-28 03:32:53,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625fc234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:32:53, skipping insertion in model container [2019-12-28 03:32:53,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:32:53" (3/3) ... [2019-12-28 03:32:53,726 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_rmo.oepc.i [2019-12-28 03:32:53,738 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:32:53,738 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:32:53,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:32:53,747 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:32:53,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,857 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:32:53,877 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:32:53,899 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:32:53,899 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:32:53,899 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:32:53,900 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:32:53,900 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:32:53,900 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:32:53,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:32:53,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:32:53,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-28 03:32:56,230 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-28 03:32:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-28 03:32:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-28 03:32:56,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:32:56,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:32:56,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:32:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:32:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash -211488886, now seen corresponding path program 1 times [2019-12-28 03:32:56,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:32:56,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610533282] [2019-12-28 03:32:56,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:32:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:32:56,593 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:32:56,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610533282] [2019-12-28 03:32:56,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:32:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:32:56,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849822687] [2019-12-28 03:32:56,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:32:56,602 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:32:56,620 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 34 transitions. [2019-12-28 03:32:56,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:32:56,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:32:56,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:32:56,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:32:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:32:56,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:32:56,644 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-28 03:32:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:32:58,296 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-28 03:32:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:32:58,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-28 03:32:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:32:58,613 INFO L225 Difference]: With dead ends: 33591 [2019-12-28 03:32:58,613 INFO L226 Difference]: Without dead ends: 25703 [2019-12-28 03:32:58,615 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:32:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-28 03:32:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-28 03:32:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-28 03:33:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-28 03:33:00,174 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-28 03:33:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:00,174 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-28 03:33:00,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:33:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-28 03:33:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:33:00,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:00,183 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] [2019-12-28 03:33:00,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:00,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1616921250, now seen corresponding path program 1 times [2019-12-28 03:33:00,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:00,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826573161] [2019-12-28 03:33:00,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:00,573 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:33:00,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826573161] [2019-12-28 03:33:00,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:00,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:00,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [416421084] [2019-12-28 03:33:00,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:00,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:00,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 03:33:00,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:00,590 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:00,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:33:00,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:00,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:33:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:33:00,595 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-28 03:33:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:01,438 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-28 03:33:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:33:01,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 03:33:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:01,642 INFO L225 Difference]: With dead ends: 41081 [2019-12-28 03:33:01,642 INFO L226 Difference]: Without dead ends: 40545 [2019-12-28 03:33:01,643 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:33:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-28 03:33:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-28 03:33:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-28 03:33:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-28 03:33:04,337 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-28 03:33:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:04,339 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-28 03:33:04,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:33:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-28 03:33:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:33:04,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:04,347 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] [2019-12-28 03:33:04,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -7572596, now seen corresponding path program 1 times [2019-12-28 03:33:04,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:04,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709832858] [2019-12-28 03:33:04,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:04,488 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:33:04,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709832858] [2019-12-28 03:33:04,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:04,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:04,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32648705] [2019-12-28 03:33:04,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:04,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:04,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:33:04,503 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:04,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:04,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:33:04,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:04,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:33:04,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:33:04,505 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-28 03:33:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:06,401 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-28 03:33:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:33:06,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:33:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:06,611 INFO L225 Difference]: With dead ends: 49778 [2019-12-28 03:33:06,611 INFO L226 Difference]: Without dead ends: 49274 [2019-12-28 03:33:06,612 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:33:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-28 03:33:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-28 03:33:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-28 03:33:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-28 03:33:08,196 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-28 03:33:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:08,197 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-28 03:33:08,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:33:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-28 03:33:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:33:08,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:08,205 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:33:08,205 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2011067022, now seen corresponding path program 1 times [2019-12-28 03:33:08,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:08,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640412880] [2019-12-28 03:33:08,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:08,260 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:33:08,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640412880] [2019-12-28 03:33:08,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:08,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:33:08,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599312964] [2019-12-28 03:33:08,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:08,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:08,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 03:33:08,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:08,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:08,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:33:08,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:33:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:33:08,274 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-28 03:33:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:10,146 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-28 03:33:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:33:10,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-28 03:33:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:10,365 INFO L225 Difference]: With dead ends: 61087 [2019-12-28 03:33:10,365 INFO L226 Difference]: Without dead ends: 61087 [2019-12-28 03:33:10,365 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:33:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-28 03:33:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-28 03:33:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-28 03:33:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-28 03:33:11,586 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-28 03:33:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:11,586 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-28 03:33:11,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:33:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-28 03:33:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:33:11,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:11,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:11,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:11,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1033937592, now seen corresponding path program 1 times [2019-12-28 03:33:11,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:11,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140247668] [2019-12-28 03:33:11,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:11,770 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:33:11,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140247668] [2019-12-28 03:33:11,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:11,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:33:11,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25995588] [2019-12-28 03:33:11,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:11,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:11,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:33:11,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:11,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:11,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:11,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:11,793 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-12-28 03:33:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:13,288 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-12-28 03:33:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:33:13,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:33:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:13,472 INFO L225 Difference]: With dead ends: 63756 [2019-12-28 03:33:13,472 INFO L226 Difference]: Without dead ends: 63756 [2019-12-28 03:33:13,472 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:33:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-12-28 03:33:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-12-28 03:33:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-28 03:33:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-28 03:33:16,943 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-28 03:33:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:16,944 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-28 03:33:16,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-28 03:33:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:33:16,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:16,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:16,962 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1464078345, now seen corresponding path program 1 times [2019-12-28 03:33:16,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:16,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119110978] [2019-12-28 03:33:16,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:17,059 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:33:17,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119110978] [2019-12-28 03:33:17,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:17,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:33:17,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [735253169] [2019-12-28 03:33:17,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:17,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:17,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:33:17,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:17,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:17,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:33:17,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:33:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:33:17,076 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-28 03:33:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:18,496 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-28 03:33:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:33:18,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-28 03:33:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:19,191 INFO L225 Difference]: With dead ends: 83685 [2019-12-28 03:33:19,191 INFO L226 Difference]: Without dead ends: 83685 [2019-12-28 03:33:19,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:33:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-28 03:33:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-28 03:33:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-28 03:33:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-28 03:33:23,165 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-28 03:33:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:23,166 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-28 03:33:23,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:33:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-28 03:33:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:33:23,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:23,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:23,180 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1943385270, now seen corresponding path program 1 times [2019-12-28 03:33:23,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:23,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127212475] [2019-12-28 03:33:23,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:23,228 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:33:23,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127212475] [2019-12-28 03:33:23,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:23,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:33:23,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666371449] [2019-12-28 03:33:23,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:23,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:23,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:33:23,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:23,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:23,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:33:23,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:33:23,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:33:23,243 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-28 03:33:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:23,585 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-28 03:33:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:33:23,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 03:33:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:23,747 INFO L225 Difference]: With dead ends: 54021 [2019-12-28 03:33:23,747 INFO L226 Difference]: Without dead ends: 54021 [2019-12-28 03:33:23,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:33:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-28 03:33:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-28 03:33:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-28 03:33:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-28 03:33:25,080 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-28 03:33:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:25,080 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-28 03:33:25,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:33:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-28 03:33:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:33:25,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:25,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:25,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash -870863555, now seen corresponding path program 1 times [2019-12-28 03:33:25,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:25,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328865606] [2019-12-28 03:33:25,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:25,147 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:33:25,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328865606] [2019-12-28 03:33:25,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:25,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:33:25,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654449936] [2019-12-28 03:33:25,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:25,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:25,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:33:25,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:25,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:25,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:25,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:25,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:25,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:25,164 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-28 03:33:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:25,891 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-28 03:33:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:33:25,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:33:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:26,027 INFO L225 Difference]: With dead ends: 68646 [2019-12-28 03:33:26,027 INFO L226 Difference]: Without dead ends: 68078 [2019-12-28 03:33:26,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:33:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-28 03:33:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-28 03:33:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-28 03:33:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-28 03:33:27,719 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-28 03:33:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:27,720 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-28 03:33:27,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-28 03:33:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:33:27,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:27,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:27,730 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash 57224143, now seen corresponding path program 1 times [2019-12-28 03:33:27,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:27,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578036398] [2019-12-28 03:33:27,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:27,824 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:33:27,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578036398] [2019-12-28 03:33:27,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:27,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:33:27,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054521367] [2019-12-28 03:33:27,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:27,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:27,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 03:33:27,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:27,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:27,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:27,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:27,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:27,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:27,838 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-28 03:33:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:28,679 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-28 03:33:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:33:28,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 03:33:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:31,200 INFO L225 Difference]: With dead ends: 67849 [2019-12-28 03:33:31,201 INFO L226 Difference]: Without dead ends: 67849 [2019-12-28 03:33:31,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:33:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-28 03:33:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-28 03:33:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-28 03:33:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-28 03:33:32,226 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-28 03:33:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:32,226 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-28 03:33:32,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-28 03:33:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:33:32,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:32,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:32,236 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 944727824, now seen corresponding path program 1 times [2019-12-28 03:33:32,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:32,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496056149] [2019-12-28 03:33:32,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:32,301 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:33:32,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496056149] [2019-12-28 03:33:32,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:32,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:33:32,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511112307] [2019-12-28 03:33:32,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:32,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:32,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 03:33:32,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:32,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:32,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:33:32,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:33:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:33:32,314 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-28 03:33:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:32,373 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-28 03:33:32,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:33:32,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-28 03:33:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:32,385 INFO L225 Difference]: With dead ends: 10212 [2019-12-28 03:33:32,385 INFO L226 Difference]: Without dead ends: 8507 [2019-12-28 03:33:32,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:33:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-28 03:33:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-28 03:33:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-28 03:33:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-28 03:33:32,815 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-28 03:33:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:32,816 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-28 03:33:32,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:33:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-28 03:33:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:33:32,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:32,819 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] [2019-12-28 03:33:32,819 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1459800295, now seen corresponding path program 1 times [2019-12-28 03:33:32,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:32,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369442380] [2019-12-28 03:33:32,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:32,873 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:33:32,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369442380] [2019-12-28 03:33:32,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:32,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:33:32,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1011019892] [2019-12-28 03:33:32,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:32,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:32,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:33:32,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:32,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:32,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:33:32,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:32,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:33:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:33:32,895 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-28 03:33:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:33,009 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-28 03:33:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:33:33,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-28 03:33:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:33,027 INFO L225 Difference]: With dead ends: 9706 [2019-12-28 03:33:33,027 INFO L226 Difference]: Without dead ends: 9706 [2019-12-28 03:33:33,028 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:33:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-28 03:33:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-28 03:33:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-28 03:33:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-28 03:33:33,207 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-28 03:33:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:33,207 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-28 03:33:33,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:33:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-28 03:33:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:33:33,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:33,212 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] [2019-12-28 03:33:33,212 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 283010040, now seen corresponding path program 1 times [2019-12-28 03:33:33,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:33,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578722913] [2019-12-28 03:33:33,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:33,322 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:33:33,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578722913] [2019-12-28 03:33:33,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:33,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:33:33,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312657135] [2019-12-28 03:33:33,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:33,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:33,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:33:33,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:33,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:33,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:33,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:33,346 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-28 03:33:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:33,735 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-28 03:33:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:33:33,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 03:33:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:33,750 INFO L225 Difference]: With dead ends: 11195 [2019-12-28 03:33:33,750 INFO L226 Difference]: Without dead ends: 11134 [2019-12-28 03:33:33,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:33:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-28 03:33:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-28 03:33:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-28 03:33:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-28 03:33:33,875 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-28 03:33:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:33,875 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-28 03:33:33,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-28 03:33:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:33,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:33,880 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:33:33,880 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2090643056, now seen corresponding path program 1 times [2019-12-28 03:33:33,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:33,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527301230] [2019-12-28 03:33:33,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:33,930 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:33:33,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527301230] [2019-12-28 03:33:33,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:33,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:33:33,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1652101133] [2019-12-28 03:33:33,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:33,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:33,974 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:33:33,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:34,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 03:33:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:34,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:34,072 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 6 states. [2019-12-28 03:33:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:34,607 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-28 03:33:34,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:33:34,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:33:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:34,667 INFO L225 Difference]: With dead ends: 15178 [2019-12-28 03:33:34,667 INFO L226 Difference]: Without dead ends: 15178 [2019-12-28 03:33:34,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:33:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-28 03:33:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-28 03:33:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-28 03:33:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-28 03:33:35,000 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-28 03:33:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:35,000 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-28 03:33:35,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-28 03:33:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:35,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:35,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:35,021 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:35,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash -959559759, now seen corresponding path program 1 times [2019-12-28 03:33:35,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:35,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117346199] [2019-12-28 03:33:35,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:35,140 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:33:35,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117346199] [2019-12-28 03:33:35,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:35,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:33:35,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225953883] [2019-12-28 03:33:35,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:35,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:35,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:33:35,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:35,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 03:33:35,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:33:35,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:33:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:33:35,237 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 8 states. [2019-12-28 03:33:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:35,856 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-28 03:33:35,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:33:35,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-28 03:33:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:35,876 INFO L225 Difference]: With dead ends: 12772 [2019-12-28 03:33:35,877 INFO L226 Difference]: Without dead ends: 12772 [2019-12-28 03:33:35,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:33:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-28 03:33:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-28 03:33:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-28 03:33:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-28 03:33:36,277 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-28 03:33:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:36,277 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-28 03:33:36,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:33:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-28 03:33:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:36,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:36,290 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:33:36,290 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash -748208846, now seen corresponding path program 1 times [2019-12-28 03:33:36,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:36,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066868754] [2019-12-28 03:33:36,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:36,418 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:33:36,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066868754] [2019-12-28 03:33:36,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:36,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:36,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453863265] [2019-12-28 03:33:36,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:36,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:36,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:33:36,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:36,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:33:36,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:36,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:36,507 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 6 states. [2019-12-28 03:33:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:36,894 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-28 03:33:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:33:36,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:33:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:36,918 INFO L225 Difference]: With dead ends: 15220 [2019-12-28 03:33:36,918 INFO L226 Difference]: Without dead ends: 15220 [2019-12-28 03:33:36,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:33:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-28 03:33:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-28 03:33:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-28 03:33:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-28 03:33:37,213 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-28 03:33:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:37,214 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-28 03:33:37,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-28 03:33:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:37,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:37,227 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:33:37,227 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1258743023, now seen corresponding path program 1 times [2019-12-28 03:33:37,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:37,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566487875] [2019-12-28 03:33:37,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:37,281 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:33:37,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566487875] [2019-12-28 03:33:37,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:37,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:33:37,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182715516] [2019-12-28 03:33:37,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:37,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:37,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:33:37,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:37,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:37,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:33:37,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:33:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:33:37,319 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-12-28 03:33:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:37,929 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-12-28 03:33:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:33:37,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-28 03:33:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:37,965 INFO L225 Difference]: With dead ends: 17525 [2019-12-28 03:33:37,965 INFO L226 Difference]: Without dead ends: 17354 [2019-12-28 03:33:37,966 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:33:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-28 03:33:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-12-28 03:33:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-12-28 03:33:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-12-28 03:33:38,302 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-12-28 03:33:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:38,302 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-12-28 03:33:38,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:33:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-12-28 03:33:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:38,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:38,316 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:33:38,317 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1239272914, now seen corresponding path program 1 times [2019-12-28 03:33:38,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:38,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954119276] [2019-12-28 03:33:38,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:38,472 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:33:38,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954119276] [2019-12-28 03:33:38,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:38,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:33:38,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505777418] [2019-12-28 03:33:38,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:38,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:38,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:33:38,508 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:38,553 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:33:38,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:33:38,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:33:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:33:38,554 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 8 states. [2019-12-28 03:33:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:39,381 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-12-28 03:33:39,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:33:39,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-28 03:33:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:39,420 INFO L225 Difference]: With dead ends: 21898 [2019-12-28 03:33:39,420 INFO L226 Difference]: Without dead ends: 21898 [2019-12-28 03:33:39,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:33:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-12-28 03:33:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-12-28 03:33:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-28 03:33:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-12-28 03:33:40,102 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-12-28 03:33:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:40,103 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-12-28 03:33:40,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:33:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-12-28 03:33:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:40,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:40,118 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:33:40,119 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:40,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2126776595, now seen corresponding path program 1 times [2019-12-28 03:33:40,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:40,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017389254] [2019-12-28 03:33:40,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:40,211 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:33:40,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017389254] [2019-12-28 03:33:40,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:40,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:40,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403103307] [2019-12-28 03:33:40,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:40,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:40,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:33:40,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:40,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:33:40,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:33:40,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:33:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:40,293 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 6 states. [2019-12-28 03:33:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:40,370 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-12-28 03:33:40,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:33:40,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:33:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:40,380 INFO L225 Difference]: With dead ends: 5654 [2019-12-28 03:33:40,380 INFO L226 Difference]: Without dead ends: 4682 [2019-12-28 03:33:40,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:33:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-12-28 03:33:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-12-28 03:33:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-28 03:33:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-12-28 03:33:40,464 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-12-28 03:33:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:40,464 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-12-28 03:33:40,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:33:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-12-28 03:33:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:33:40,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:40,471 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:33:40,472 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1987685399, now seen corresponding path program 1 times [2019-12-28 03:33:40,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:40,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376002255] [2019-12-28 03:33:40,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:40,540 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:33:40,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376002255] [2019-12-28 03:33:40,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:40,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:33:40,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850275399] [2019-12-28 03:33:40,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:40,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:40,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:33:40,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:40,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:40,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:33:40,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:33:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:33:40,588 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-12-28 03:33:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:40,642 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-12-28 03:33:40,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:33:40,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-28 03:33:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:40,651 INFO L225 Difference]: With dead ends: 4819 [2019-12-28 03:33:40,651 INFO L226 Difference]: Without dead ends: 4819 [2019-12-28 03:33:40,652 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:33:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-28 03:33:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-12-28 03:33:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-12-28 03:33:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-12-28 03:33:40,735 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-12-28 03:33:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:40,735 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-12-28 03:33:40,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:33:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-12-28 03:33:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:33:40,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:40,743 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] [2019-12-28 03:33:40,743 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash -788602436, now seen corresponding path program 1 times [2019-12-28 03:33:40,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:40,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001454435] [2019-12-28 03:33:40,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:40,806 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:33:40,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001454435] [2019-12-28 03:33:40,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:40,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:40,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242314932] [2019-12-28 03:33:40,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:40,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:40,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 73 transitions. [2019-12-28 03:33:40,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:40,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:40,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:33:40,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:33:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:33:40,840 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-12-28 03:33:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:41,020 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-12-28 03:33:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:33:41,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-28 03:33:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:41,028 INFO L225 Difference]: With dead ends: 4737 [2019-12-28 03:33:41,029 INFO L226 Difference]: Without dead ends: 4737 [2019-12-28 03:33:41,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:33:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-12-28 03:33:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-12-28 03:33:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-12-28 03:33:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-12-28 03:33:41,107 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-12-28 03:33:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:41,107 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-12-28 03:33:41,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:33:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-12-28 03:33:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:33:41,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:41,115 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] [2019-12-28 03:33:41,115 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash 954207899, now seen corresponding path program 1 times [2019-12-28 03:33:41,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:41,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181967322] [2019-12-28 03:33:41,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:41,193 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:33:41,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181967322] [2019-12-28 03:33:41,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:41,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:33:41,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851079478] [2019-12-28 03:33:41,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:41,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:41,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 73 transitions. [2019-12-28 03:33:41,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:41,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:33:41,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:33:41,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:41,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:33:41,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:33:41,230 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-12-28 03:33:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:41,716 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-12-28 03:33:41,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:33:41,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-28 03:33:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:41,723 INFO L225 Difference]: With dead ends: 4873 [2019-12-28 03:33:41,723 INFO L226 Difference]: Without dead ends: 4820 [2019-12-28 03:33:41,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:33:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-12-28 03:33:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-12-28 03:33:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-28 03:33:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-12-28 03:33:41,765 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-12-28 03:33:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:41,766 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-12-28 03:33:41,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:33:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-12-28 03:33:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 03:33:41,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:41,772 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:41,772 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:41,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1009148223, now seen corresponding path program 1 times [2019-12-28 03:33:41,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:41,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911181708] [2019-12-28 03:33:41,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:41,817 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:33:41,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911181708] [2019-12-28 03:33:41,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:41,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:33:41,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015041959] [2019-12-28 03:33:41,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:41,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:41,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 274 transitions. [2019-12-28 03:33:41,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:41,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:33:41,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:33:41,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:41,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:33:41,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:33:41,956 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-12-28 03:33:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:42,127 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-12-28 03:33:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:33:42,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-28 03:33:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:42,134 INFO L225 Difference]: With dead ends: 5804 [2019-12-28 03:33:42,134 INFO L226 Difference]: Without dead ends: 5513 [2019-12-28 03:33:42,134 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:33:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-12-28 03:33:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-12-28 03:33:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-12-28 03:33:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-12-28 03:33:42,186 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-12-28 03:33:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:42,189 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-12-28 03:33:42,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:33:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-12-28 03:33:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 03:33:42,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:42,196 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:42,197 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -725997759, now seen corresponding path program 1 times [2019-12-28 03:33:42,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:42,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779486836] [2019-12-28 03:33:42,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:42,271 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:33:42,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779486836] [2019-12-28 03:33:42,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:42,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:33:42,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653816617] [2019-12-28 03:33:42,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:42,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:42,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 274 transitions. [2019-12-28 03:33:42,402 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:42,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:33:42,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:33:42,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:33:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:33:42,405 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-12-28 03:33:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:42,497 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-12-28 03:33:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:33:42,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-28 03:33:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:42,503 INFO L225 Difference]: With dead ends: 5316 [2019-12-28 03:33:42,503 INFO L226 Difference]: Without dead ends: 5316 [2019-12-28 03:33:42,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:33:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-28 03:33:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-12-28 03:33:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-12-28 03:33:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-12-28 03:33:42,553 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-12-28 03:33:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:42,553 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-12-28 03:33:42,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:33:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-12-28 03:33:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:33:42,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:42,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:42,557 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 574359335, now seen corresponding path program 1 times [2019-12-28 03:33:42,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:42,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287683786] [2019-12-28 03:33:42,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:42,624 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:33:42,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287683786] [2019-12-28 03:33:42,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:42,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:42,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540169894] [2019-12-28 03:33:42,625 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:42,696 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:42,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:33:42,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:42,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:33:42,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:33:42,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:33:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:33:42,818 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-12-28 03:33:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:42,949 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-12-28 03:33:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:33:42,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 03:33:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:42,955 INFO L225 Difference]: With dead ends: 5452 [2019-12-28 03:33:42,955 INFO L226 Difference]: Without dead ends: 5452 [2019-12-28 03:33:42,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 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:33:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-28 03:33:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-12-28 03:33:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-28 03:33:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-12-28 03:33:42,998 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-12-28 03:33:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:42,999 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-12-28 03:33:42,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:33:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-12-28 03:33:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:33:43,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:43,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:43,003 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:43,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 585675462, now seen corresponding path program 1 times [2019-12-28 03:33:43,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:43,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16356896] [2019-12-28 03:33:43,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:43,057 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:33:43,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16356896] [2019-12-28 03:33:43,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:43,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:33:43,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1186389218] [2019-12-28 03:33:43,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:43,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:43,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:33:43,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:43,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:33:43,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:33:43,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:33:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:33:43,202 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-12-28 03:33:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:43,456 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-12-28 03:33:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:33:43,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-28 03:33:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:43,463 INFO L225 Difference]: With dead ends: 4884 [2019-12-28 03:33:43,463 INFO L226 Difference]: Without dead ends: 4828 [2019-12-28 03:33:43,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:33:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-28 03:33:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-12-28 03:33:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-28 03:33:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-12-28 03:33:43,508 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-12-28 03:33:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:43,508 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-12-28 03:33:43,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:33:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-12-28 03:33:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:33:43,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:43,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:43,515 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1491533881, now seen corresponding path program 1 times [2019-12-28 03:33:43,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:43,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280998775] [2019-12-28 03:33:43,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:33:43,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280998775] [2019-12-28 03:33:43,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:43,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:33:43,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574919008] [2019-12-28 03:33:43,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:43,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:43,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:33:43,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:44,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 03:33:44,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 03:33:44,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 03:33:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:33:44,008 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 13 states. [2019-12-28 03:33:44,365 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-28 03:33:44,513 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-28 03:33:45,325 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-28 03:33:46,621 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-28 03:33:48,591 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-28 03:33:48,968 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-28 03:33:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:49,873 INFO L93 Difference]: Finished difference Result 8667 states and 19207 transitions. [2019-12-28 03:33:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-28 03:33:49,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-28 03:33:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:49,884 INFO L225 Difference]: With dead ends: 8667 [2019-12-28 03:33:49,884 INFO L226 Difference]: Without dead ends: 8667 [2019-12-28 03:33:49,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=669, Invalid=3363, Unknown=0, NotChecked=0, Total=4032 [2019-12-28 03:33:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8667 states. [2019-12-28 03:33:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8667 to 5107. [2019-12-28 03:33:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-28 03:33:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-12-28 03:33:49,948 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-12-28 03:33:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:49,949 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-12-28 03:33:49,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 03:33:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-12-28 03:33:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:33:49,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:49,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:49,954 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1280182968, now seen corresponding path program 1 times [2019-12-28 03:33:49,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:49,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485102192] [2019-12-28 03:33:49,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:50,063 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:33:50,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485102192] [2019-12-28 03:33:50,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:50,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:33:50,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909262115] [2019-12-28 03:33:50,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:50,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:50,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:33:50,211 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:50,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:33:50,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:33:50,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:50,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:33:50,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:33:50,213 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 5 states. [2019-12-28 03:33:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:50,258 INFO L93 Difference]: Finished difference Result 5107 states and 11433 transitions. [2019-12-28 03:33:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:33:50,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 03:33:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:50,265 INFO L225 Difference]: With dead ends: 5107 [2019-12-28 03:33:50,265 INFO L226 Difference]: Without dead ends: 5107 [2019-12-28 03:33:50,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:33:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2019-12-28 03:33:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4871. [2019-12-28 03:33:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2019-12-28 03:33:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 10906 transitions. [2019-12-28 03:33:50,314 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 10906 transitions. Word has length 96 [2019-12-28 03:33:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:50,314 INFO L462 AbstractCegarLoop]: Abstraction has 4871 states and 10906 transitions. [2019-12-28 03:33:50,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:33:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 10906 transitions. [2019-12-28 03:33:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:33:50,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:50,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, 1, 1, 1, 1, 1, 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:33:50,322 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:50,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash -392679287, now seen corresponding path program 1 times [2019-12-28 03:33:50,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:50,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951687304] [2019-12-28 03:33:50,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:33:50,457 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:33:50,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951687304] [2019-12-28 03:33:50,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:33:50,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:33:50,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797896320] [2019-12-28 03:33:50,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:33:50,475 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:33:50,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:33:50,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:33:50,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:33:50,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:33:50,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:33:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:33:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:33:50,631 INFO L87 Difference]: Start difference. First operand 4871 states and 10906 transitions. Second operand 11 states. [2019-12-28 03:33:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:33:52,660 INFO L93 Difference]: Finished difference Result 19825 states and 43857 transitions. [2019-12-28 03:33:52,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 03:33:52,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-28 03:33:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:33:52,675 INFO L225 Difference]: With dead ends: 19825 [2019-12-28 03:33:52,675 INFO L226 Difference]: Without dead ends: 12491 [2019-12-28 03:33:52,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-28 03:33:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2019-12-28 03:33:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 4960. [2019-12-28 03:33:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4960 states. [2019-12-28 03:33:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4960 states to 4960 states and 10977 transitions. [2019-12-28 03:33:52,762 INFO L78 Accepts]: Start accepts. Automaton has 4960 states and 10977 transitions. Word has length 96 [2019-12-28 03:33:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:33:52,762 INFO L462 AbstractCegarLoop]: Abstraction has 4960 states and 10977 transitions. [2019-12-28 03:33:52,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:33:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4960 states and 10977 transitions. [2019-12-28 03:33:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:33:52,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:33:52,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:33:52,768 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:33:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:33:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -325970013, now seen corresponding path program 2 times [2019-12-28 03:33:52,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:33:52,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004929941] [2019-12-28 03:33:52,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:33:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:33:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:33:52,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:33:52,851 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:33:53,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:33:53 BasicIcfg [2019-12-28 03:33:53,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:33:53,102 INFO L168 Benchmark]: Toolchain (without parser) took 61008.68 ms. Allocated memory was 137.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 99.9 MB in the beginning and 995.2 MB in the end (delta: -895.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-28 03:33:53,103 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 03:33:53,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.51 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.5 MB in the beginning and 157.0 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:33:53,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.23 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:33:53,107 INFO L168 Benchmark]: Boogie Preprocessor took 41.12 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.2 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:33:53,108 INFO L168 Benchmark]: RCFGBuilder took 780.03 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.4 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:33:53,108 INFO L168 Benchmark]: TraceAbstraction took 59382.47 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.7 MB in the beginning and 995.2 MB in the end (delta: -887.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 03:33:53,110 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 was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.51 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.5 MB in the beginning and 157.0 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.23 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.12 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.03 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 108.4 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59382.47 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.7 MB in the beginning and 995.2 MB in the end (delta: -887.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L793] 0 pthread_t t1553; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L794] FCALL, FORK 0 pthread_create(&t1553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L795] 0 pthread_t t1554; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L796] FCALL, FORK 0 pthread_create(&t1554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? 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=1, 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] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? 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=1, 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] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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) [L803] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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 [L805] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] 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=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 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 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 58.9s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8078 SDtfs, 9300 SDslu, 20078 SDs, 0 SdLazy, 9800 SolverSat, 498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 129 SyntacticMatches, 19 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 89902 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1997 NumberOfCodeBlocks, 1997 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1873 ConstructedInterpolants, 0 QuantifiedInterpolants, 365587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...